Combinatorics Probability Computing · 2003 · 199 citations · 4 references
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely:
4
The eigenvalues of random symmetric matrices
Zoltán Füredi, János Komlós · COMBINATORICA · 1981 · 651 citations