Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
From MaRDI portal
Publication:2421825
DOI10.1214/18-AOP1293zbMath1447.60017arXiv1704.02953OpenAlexW2746517179MaRDI QIDQ2421825
Antti Knowles, Charles Bordenave, Florent Benaych-Georges
Publication date: 18 June 2019
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.02953
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Random matrices (algebraic aspects) (15B52)
Related Items (27)
Scalable estimation of epidemic thresholds via node sampling ⋮ Noise sensitivity for the top eigenvector of a sparse random matrix ⋮ Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs ⋮ Concentration of the spectral norm of Erdős-Rényi random graphs ⋮ Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs ⋮ Upper tail of the spectral radius of sparse Erdös-Rényi graphs ⋮ Detection thresholds in very sparse matrix completion ⋮ Bernoulli random matrices ⋮ Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs ⋮ Random geometric graph: some recent developments and perspectives ⋮ Spectral norm bounds for block Markov chain random matrices ⋮ Edge rigidity and universality of random regular graphs of intermediate degree ⋮ Non-backtracking spectra of weighted inhomogeneous random graphs ⋮ Sparse general Wigner-type matrices: Local law and eigenvector delocalization ⋮ Spectral radii of sparse random matrices ⋮ Delocalization transition for critical Erdős-Rényi graphs ⋮ Local law and complete eigenvector delocalization for supercritical Erdős-Rényi graphs ⋮ Extremal eigenvalues of critical Erdős-Rényi graphs ⋮ Spectral edge in sparse random graphs: upper and lower tail large deviations ⋮ Sparse random tensors: concentration, regularization and applications ⋮ The completely delocalized region of the Erdős-Rényi graph ⋮ A spectral signature of breaking of ensemble equivalence for constrained random graphs ⋮ Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs ⋮ Large deviations for the largest eigenvalue of Gaussian networks with constant average degree ⋮ Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs ⋮ Poisson statistics and localization at the spectral edge of sparse Erdős-Rényi graphs ⋮ Eigenvalues of the non-backtracking operator detached from the bulk
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
- Localization and delocalization for heavy tailed band matrices
- Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
- Poisson convergence for the largest eigenvalues of heavy tailed random matrices
- The eigenvalues of random symmetric matrices
- The dimension-free structure of nonhomogeneous random matrices
- Local law and Tracy-Widom limit for sparse random matrices
- Poisson statistics for the largest eigenvalues of Wigner random matrices with heavy tails
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- A necessary and sufficient condition for edge universality of Wigner matrices
- The Largest Eigenvalue of Sparse Random Graphs
- Spectral techniques applied to sparse random graphs
- Concentration and regularization of random graphs
- Spectral norm of random matrices
This page was built for publication: Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs