Random-matrix bulk statistics for random regular graphs of fixed degree
23No. 1,733 in all physics · No. 67 in Mathematical Physics
Adjacency matrix of a uniform random d-regular graph on $N$ vertices with $d\ge 3$ fixed. Prove that bulk local eigenvalue statistics (e.g. the gap distribution at a fixed energy inside $(-2\sqrt{d-1}, 2\sqrt{d-1})$) converge to GOE as $N\to\infty$. Answer: a proof.
What would settle it
A proof of GOE bulk gap or correlation universality for one fixed d.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
Bulk universality is proven for $N^{\alpha} \le d \le N^{2/3-\alpha}$ (Bauerschmidt, Huang, Knowles and Yau, Annals of Probability 2017, arXiv 1505.06700); at fixed d, optimal eigenvalue rigidity and Tracy-Widom edge universality were proven by Huang, McKenzie and Yau (arXiv 2412.20263, 2024).
No solutions, ideas or subproblems yet.
See also
- Related Why chaotic quantum spectra follow random-matrix statistics
- Related Upper critical dimension of the Anderson transition
- Related Critical disorder and universality class of the MBL transition
- Related Delocalization of random band matrices in two and three dimensions
Details, signature and history
- Kind
- Well-posed question
- Answer
- Proof
- Topic review
- G. Stolz, An introduction to the mathematics of Anderson localization, Contemporary Mathematics 552, 2011 (arXiv 1104.2317). Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 42c6615eae4f…
- Public log
- Entry 1,596, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.