Statistical field theory of random graphs with prescribed degrees
arXiv:2410.11191 · doi:10.1088/1742-5468/add0a4
Abstract
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of constraints that enforce the desired degree at each vertex. Building on top of recent results where similar methods are applied to random regular graph counting, we develop an accurate statistical field theory description for the adjacency matrix spectra of graphs with prescribed degrees. For large graphs, the expectation values are dominated by functional saddle points satisfying explicit equations. For the case of regular graphs, this immediately leads to the known McKay distribution. We then consider mixed-regular graphs with N1 vertices of degree d1, N2 vertices of degree d2, etc, such that the ratios N_i/N are kept fixed as N goes to infinity. For such graphs, the eigenvalue densities are governed by nonlinear integral equations of the Hammerstein type. Solving these equations numerically reproduces with an excellent accuracy the empirical eigenvalue distributions.
arXiv commentv2: version accepted for publication
References in corpus (29)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Random graphs with a given degree sequence
- Anderson localization on random regular graphs
- Solution of the 2-star model of a network
- Sparse random matrices: the eigenvalue spectrum revisited
- Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
- Spectra of Euclidean Random Matrices
- Spectra of Sparse Random Matrices
- Breaking of ensemble equivalence in networks
- Transitions toward Quantum Chaos: with Supersymmetry from Poisson to Gauss
- Anderson model on Bethe lattices: density of states, localization properties and isolated eigenvalue
- Cavity and replica methods for the spectral density of sparse symmetric random matrices
- Spectra of random networks with arbitrary degrees
- Return times of random walk on generalized random graphs
- Finite size correction to the spectrum of regular random graphs: an analytical solution
- Universality in Anderson localization on random graphs with varying connectivity
- Stress Relaxation of Near-Critical Gels
- Universality of the local regime for the block band matrices with a finite number of blocks
- Characteristic polynomials for 1D random band matrices from the localization side
- Spectral density of random graphs with topological constraints
- Analytic solution of the resolvent equations for heterogeneous random graphs: spectral and localization properties
- The two-star model: exact solution in the sparse regime and condensation transition
- Random matrices with row constraints and eigenvalue distributions of graph Laplacians
- Statistical properties of eigenvectors and eigenvalues of structured random matrices
- Entropy of microcanonical finite-graph ensembles
- Robust extended states in Anderson model on partially disordered random regular graphs
- A Gaussian integral that counts regular graphs
- Hammerstein equations for sparse random matrices
- First return times on sparse random graphs