Eigenvalue spacings for regular graphs
D. Jakobson, S. D. Miller, I. Rivin, Z. Rudnick
Abstract
We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments indicate that the level spacing distribution of a generic k-regular graph approaches that of the Gaussian Orthogonal Ensemble of random matrix theory as we increase the number of vertices. A review of the basic facts on graphs and their spectra is included.
Create a lesson
Related papers
A universal sector of N=1 class S spectra
Ritabrata Bhattacharya, Abhay Katyal, Oscar Varela
Reflected entropy and islands in JT gravity from partial dimensional reduction
Debarshi Basu, Himanshu Chourasiya
q-deformed Weil-Petersson Volumes from the Spectral Edge of DSSYK and Supersymmetric Extensions
Wasif Ahmed, Joydeep Naskar, Krishan Saraswat
Modular Properties of Generalised Gibbs Ensembles: The Deformed KdV Hierarchy
Faisal Karimi
The Quasiparticle Ansatz for Relativistic Continuous Matrix Product States
Silviu S. Pufu, Benjamin T. Søgaard, Spyros Terlemes
Anomaly induced transport in holographic superconductors
Ashis Tamang, Nishal Rai, Javier Esteban et al.