Low eigenvalues of Laplacian matrices of large random graphs
From MaRDI portal
Publication:714953
DOI10.1007/S00440-011-0357-4zbMath1251.05098OpenAlexW1995825863MaRDI QIDQ714953
Publication date: 12 October 2012
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00440-011-0357-4
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52) Convergence of probability measures (60B10)
Related Items (6)
Spectral statistics of sparse Erdős-Rényi graph Laplacians ⋮ Spectral properties for the Laplacian of a generalized Wigner matrix ⋮ Spectrum of Lévy-Khintchine random Laplacian matrices ⋮ Random matrix theory in statistics: a review ⋮ Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs ⋮ Large deviation principle for the maximal eigenvalue of inhomogeneous Erdős-Rényi random graphs
Cites Work
- Spectral distributions of adjacency and Laplacian matrices of random graphs
- On the accuracy of normal approximation in the invariance principle
- Spectral measure of large random Hankel, Markov and Toeplitz matrices
- Spectrum of large random reversible Markov chains: two examples
- Density of states of sparse random matrices
- Matrix Analysis
- Order Statistics
- Eigenvalue distribution of large weighted random graphs
- Probability Inequalities
- Random incidence matrices: moments of the spectral density
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Low eigenvalues of Laplacian matrices of large random graphs