ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GngeoG_n^{\mathrm{geo}} be a random geometric graph generated by independent uniform points on a high-dimensional sphere, with connection function KnK_n applied to endpoint inner products, and let GnERG_n^{\mathrm{ER}} be the Erdős–Rényi graph with the same edge density. If κn\kappa_n is the centered and standardized spherical kernel operator, then the conjecture asserts that n3[tr⁡(κn3)]2⟶0⟹dTV ⁣(L(Gngeo),L(GnER))⟶0.n^3\left[\operatorname{tr}(\kappa_n^3)\right]^2\longrightarrow 0\quad\Longrightarrow\quad d_{\mathrm{TV}}\!\left(\mathcal{L}(G_n^{\mathrm{geo}}),\mathcal{L}(G_n^{\mathrm{ER}})\right)\longrightarrow 0. Equivalently, for every sequence of tests distinguishing the two graph models, the sum of the two error probabilities has lower limit at least 11.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.