Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: Family 219. GOE universality for random regular graphs with weak disorder
Family claims › Probability and statistical mechanics · lines 1479–1484
OpenAI@2026-10-07#rem:oai-219
For every fixed degree , the bulk adjacency-eigenvalue point process of a uniform simple random -regular graph converges to the Gaussian orthogonal ensemble law, including for cubic graphs. The same fixed-energy universality persists under sufficiently weak fixed iid uniform diagonal disorder, throughout compact bands strictly inside the clean spectral edges.
The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- remark: Remark: Family 211. Geometry, diffusion, and spectra of random planar maps
- remark: Remark: Family 212. No bigeodesics and smooth limit shapes in planar first-passage percolation
- remark: Remark: Family 213. No infinite critical clusters on quasi-transitive graphs
- remark: Remark: Family 214. The Benjamini–Schramm nonuniqueness conjecture
- remark: Remark: Family 215. Massive continuum limits and exact mass asymptotics for planar O(n) models
- remark: Remark: Family 216. Critical logarithmic corrections and BKT scaling for the planar XY model
- remark: Remark: Family 217. The low-temperature Sherrington–Kirkpatrick fluctuation law
- remark: Remark: Family 218. Conformal universality for weakly interacting and disordered Ising models