On the extremal spectral properties of random graphs
C. T Mart\'inez Mart\'inez, J. A. M\'endez Berm\'udez

TL;DR
This paper investigates the spectral properties of random graph adjacency matrices, revealing how their extreme eigenvalues and eigenstate distributions transition from Poisson to GOE behavior as the average degree increases.
Contribution
It provides analytical and numerical insights into the spectral density and eigenvalue distributions of ER and RGG models, highlighting the PE-GOE transition and its relation to graph delocalization.
Findings
Eigenvalues approach Tracy-Widom distribution for high average degree.
Spectral density expressions depend on average degree and percolation threshold.
Distributions of eigenvalue spacings and participation ratios reveal the PE-GOE transition.
Abstract
In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs (RGGs). Indeed, the adjacency matrices of both graph models are diluted versions of the Gaussian Orthogonal Ensemble (GOE) of random matrix theory (RMT), such that a transition from the Poisson Ensemble (PE) and the GOE is observed by increasing the graph average degree . First, we write down expressions for the spectral density in terms of for the regimes below and above the percolation threshold. Then, we show that the distributions of both, the largest and second-largest eigenvalues approach the Tracy-Widom distribution of type 1 for , while $\langle \lambda_1…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Spectral Theory in Mathematical Physics · advanced mathematical theories
