ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Gd,N\mathcal{G}_{d,N} denote the space of random dd-regular graphs on NN vertices, and let TN:Gd,N→RT_N: \mathcal{G}_{d,N} \to \mathbb{R} be a sequence of statistics that distinguishes edge eigenvector distributions from the standard Gaussian distribution N(0,1)\mathcal{N}(0,1). Sharp lower bound conjecture. There exists a constant c>0c>0 such that

lim inf⁡N→∞N1/6⋅dist⁡TV(TN,N(0,1))≥c.\liminf_{N \to \infty} N^{1/6} \cdot \operatorname{dist}_{\mathrm{TV}}(T_N,\mathcal{N}(0,1)) \geq c.

The conjecture asserts that the N−1/6N^{-1/6} 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 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.