Cubic spectral conjecture for random geometric graph detection
Statement
Let be a random geometric graph generated by independent uniform points on a high-dimensional sphere, with connection function applied to endpoint inner products, and let be the Erdős–Rényi graph with the same edge density. If is the centered and standardized spherical kernel operator, then the conjecture asserts that Equivalently, for every sequence of tests distinguishing the two graph models, the sum of the two error probabilities has lower limit at least .
Record
- Added
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.