Sparse random graphs: Eigenvalues and eigenvectors
Linh V. Tran, Van H. Vu, Ke Wang · Random Structures and Algorithms · 2012
Abstract In this paper, we prove the semi‐circular law for the eigenvalues of regular random graph G n , d in the case d → ∞ , complementing a previous result of McKay for fixed d . We also obtain a upper bound on the infinity norm of eigenvectors of Erdős–Rényi random graph G ( n , p ), answering a question raised by Dekel–Lee–Linial. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012
Cited by 138 works. doi:10.1002/rsa.20406 Open-access PDF
Authors
References
- Normalized cuts and image segmentation
- Random Graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- On the Distribution of the Roots of Certain Symmetric Matrices
- Matrix perturbation theory
- Random Graphs
- Random Graphs
- The eigenvalues of random symmetric matrices
- Matrix Perturbation Theory
- Random Graphs