GOE bulk universality for fixed-degree random regular graphs

OpenAI

For every fixed degree d≥3 and energy strictly inside the Kesten–McKay bulk, the unfolded adjacency-eigenvalue point process of a uniform simple labelled d-regular graph converges at that fixed energy to the GOE bulk process along all admissible graph sizes, without extra conditioning.

Sources for this record

What was already known

Prior work gave local laws, delocalization and edge universality at fixed degree. Bourgade and Huang proved fixed-energy point-process universality only for growing degree and stated the fixed-degree conjecture.

AI involvement AI-led

OpenAI credits its internal model with the manuscript’s Gaussian-mark and continuous-switching argument. Earlier local-law and Dyson Brownian motion methods are human inputs.

OpenAI receives manuscript authorship and the repository attributes these preprints to its internal model; human oversight and exact prompting are not specified.

Importance Major

The result resolves fixed-energy GOE bulk universality even for cubic random regular graphs.

Limitations

No claim-matching formalization or completed human proof review is documented. The weak-Anderson extension uses this clean result and does not independently verify it.

Technical verification Reported

The original TeX provides a detailed argument, but the repository’s formalization catalogue does not identify a matching Lean check and no completed human proof review was found. A proof manuscript alone is not a check.

Human understanding Few

No named human explanation of the new central mechanism is documented; Few is the evidence default.

Correction and publication history

2026-10-18 · publication

If correct, the result resolves fixed-energy GOE bulk universality even for cubic random regular graphs.

Read this published revision