ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,d,p)G(n,d,p) be the spherical random geometric graph and let G(n,p)G(n,p) be the Erdős–Rényi random graph. For probability distributions on a finite set, define total variation distance by

TV⁡(μ,μ′)=12∑x∈Ω∣μ(x)−μ′(x)∣.\operatorname{TV}(\mu,\mu')=\frac{1}{2}\sum_{x\in\Omega}|\mu(x)-\mu'(x)|.

Write a≫ba\gg b to mean that a/b→∞a/b\to\infty as n→∞n\to\infty. Bubeck–Ding–Eldan–Rácz conjecture. If

d≫n3p3(log⁡1/p)3,d\gg n^3p^3(\log 1/p)^3,

then

TV⁡(G(n,p),G(n,d,p))→0\operatorname{TV}(G(n,p),G(n,d,p))\to 0

as n→∞n\to\infty. This is the high-dimensional, indistinguishable regime of the threshold problem for random geometric graphs. The source presents the statement as a conjecture and gives no resolution evidence for this exact formulation.

Record

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.