The sharp lower bound conjecture for edge eigenvector Gaussian approximation
Statement
Let denote the space of random -regular graphs on vertices, and let be a sequence of statistics that distinguishes edge eigenvector distributions from the standard Gaussian distribution . Sharp lower bound conjecture. There exists a constant such that
The conjecture asserts that the convergence scale suggested by the local-resampling, moment, and constrained-DBM approaches is optimal for edge eigenvector universality. The supplied discussion presents this as strongly supported by several methods, but does not establish the lower bound or specify a proof for every distinguishing sequence of statistics.
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.