Finite size correction to the spectrum of regular random graphs: an analytical solution

Abstract

We develop a thorough analytical study of the $O(1/N)$ correction to the spectrum of regular random graphs with $N\to \infty$ nodes. The finite size fluctuations of the resolvent are given in terms of a weighted series over the contributions coming from loops of all possible lengths, from which we obtain the isolated eigenvalue as well as an analytical expression for the $O(1/N)$ correction to the continuous part of the spectrum. The comparison between this analytical formula and direct diagonalization results exhibits an excellent agreement, confirming the correctness of our expression.

Extended version with an extra appendix explaining the connection with rigorous results

References in corpus (8)

• Spectra of Sparse Random Matrices
• On the localization transition in symmetric random matrices
• Spectra of Modular and Small-World Matrices
• Functional limit theorems for random regular graphs
• Finite size corrections to disordered Ising models on Random Regular Graphs
• Finite size corrections to disordered systems on Erdös-Rényi random graphs
• Exchangeable pairs, switchings, and random regular graphs
• Spectral Density of Complex Networks with Two Species of Nodes

Cited by in corpus (34)

• Anderson localization on random regular graphs
• From Anderson localization on Random Regular Graphs to Many-Body localization
• Statistics of eigenstates near the localization transition on random regular graphs
• Two critical localization lengths in the Anderson transition on random graphs
• Spectral Theory of Sparse Non-Hermitian Random Matrices
• Local Kesten--McKay law for random regular graphs
• Level compressibility for the Anderson model on regular random graphs and the eigenvalue statistics in the extended phase
• Large deviation function for the number of eigenvalues of sparse random graphs inside an interval
• Edge rigidity and universality of random regular graphs of intermediate degree
• Dynamical Mean-Field Theory of Complex Systems on Sparse Directed Networks
• Large deviation theory for diluted Wishart random matrices
• Random matrices with row constraints and eigenvalue distributions of graph Laplacians
• Mobility Edge in the Anderson model on partially disordered random regular graphs
• Index statistical properties of sparse random graphs
• On the quantum spin glass transition on the Bethe lattice
• Symmetry Violation of Quantum Multifractality: Gaussian fluctuations versus Algebraic Localization
• Moments of the inverse participation ratio for the Laplacian on finite regular graphs
• Dirty bosons on the Cayley tree: Bose-Einstein condensation versus ergodicity breaking
• Imaginary replica analysis of loopy regular random graphs
• Spectrum of Random $d$-regular Graphs Up to the Edge
• Finite plateau in spectral gap of polychromatic constrained random networks
• Robust extended states in Anderson model on partially disordered random regular graphs
• The Sherrington-Kirkpatrick model for spin glasses: A new approach for the solution
• A Flow in the Forest
• A Gaussian integral that counts regular graphs
• Finite size effects. The averaged eigenvalue density of Wigner random sign real symmetric matrices
• Hammerstein equations for sparse random matrices
• Replica-symmetric approach to the typical eigenvalue fluctuations of Gaussian random matrices
• Global eigenvalue fluctuations of random biregular bipartite graphs
• First return times on sparse random graphs
• Statistical field theory of random graphs with prescribed degrees
• Top eigenpair statistics of diluted Wishart matrices
• Replica approach to the generalized Rosenzweig-Porter model
• Resistance distance distribution in large sparse random graphs