GOE bulk universality for regular graphs with weak Anderson disorder

For every fixed degree d ≥ 3, the bulk adjacency-eigenvalue point process of a uniform simple random d-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.

Manuscripts (2)

Fixed-energy universality for weak Anderson disorder on random regular graphs

October 5, 2026 · source · cite as \cite{OAI:Fixed-energy-universality-for-weak-Anderson-disorder-on-random-regular-graphs-October-5-2026}

For every fixed degree d ≥ 3, we prove fixed-energy GOE universality for the adjacency matrix of a uniformly random simple labelled d-regular graph with independent uniform diagonal disorder. The disorder strength is positive, sufficiently small, and fixed as the graph grows. At each fixed energy in a compact subinterval of the clean spectral band, the full microscopic eigenvalue point process converges to the GOE bulk process after rescaling by the positive density of states of the corresponding infinite-tree operator. The permitted disorder strength depends on the degree and the distance from the clean spectral edges.

GOE bulk universality for fixed-degree random regular graphs

September 23, 2026 · source · cite as \cite{OAI:GOE-bulk-universality-for-fixed-degree-random-regular-graphs-September-23-2026}

We prove the fixed-degree bulk-universality conjecture for random regular graphs. For every fixed integer d ≥ 3 and every fixed energy in the open Kesten–McKay bulk, the unfolded eigenvalue point process of the adjacency matrix of a uniform simple labelled d-regular graph converges to the GOE bulk process. The convergence holds along all admissible graph sizes, without additional conditioning.

Result 219 · Probability and statistical mechanics. Imported from openai/math, a collection of manuscripts produced by an OpenAI model; results are at different stages of verification. Discussion below is by Lemma members.