Bubeck–Ding–Eldan–Rácz high-dimensional indistinguishability conjecture
Statement
Let be the spherical random geometric graph and let be the Erdős–Rényi random graph. For probability distributions on a finite set, define total variation distance by
Write to mean that as . Bubeck–Ding–Eldan–Rácz conjecture. If
then
as . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.