Spectra of edge-independent random graphs

Electronic Journal of Combinatorics

Volumn 20, Issue 4, 2013, Pages

  Lu, Linyuan ^a   Peng, Xing ^b  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Edge independent random graphs; Eigen values; Laplacian eigenvalues; Random symmetric matrices; Trace method

Indexed keywords

EID: 84888613399     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/3576     Document Type: Article

References (21)

1. N. Alon, M. Krivelevich, and V. H. Vu, Concentration of eigenvalues of random matrices, Israel Math. J., 131 (2002), 259-267.
2. H. Chernoff, A note on an inequality involving the normal distribution, Ann. Probab., 9 (1981), 533-535.
3. F. Chung, Spectral graph theory, AMS publications, 1997.
4. F. Chung, L. Lu, and V. H. Vu, Eigenvalues of random power law graphs, Ann. Comb., 7 (2003), 21-33.
5. F. Chung, L. Lu, and V. H. Vu, Spectra of random graphs with given expected degrees, Proc. Natl. Acad. Sci. USA, 100(11) (2003), 6313-6318.
6. F. Chung and M. Radcliffe, On the spectra of general random graphs, Electron. J. Combin., 18(1) (2011), P215.
7. A. Coja-Oghlan, On the Laplacian eigenvalues of G(n; p), Combin. Probab. Comput., 16(6) (2007), 923-946.
8. A. Coja-Oghlan and A. Lanka, The spectral gap of random graphs with given expected degrees, Electron. J. Combin., 16 (2009), R138.
9. D. M. Cvetkovič, M. Doob, and H. Sachs, Spectra of Graphs, Theory and Applications, Academic Press, 1980.
10. X. Ding and T. Jiang, Spectral distributions of adjacency and Laplacian matrices of random graphs, Ann. Appl. Probab., 20(6) (2010), 2086-2117.
11. U. Feige and E. Ofek, Spectral techniques applied to sparse random graphs, Random Structures Algorithms, 27(2) (2005), 251-275.
12. J. N. Franklin, Matrix Theory, Prentice-Hall, 1968.
13. J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue in random regular graphs, in Proc. 21st ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1989, 587-598.
14. J. Friedman, On the second eigenvalue and random walks in random d-regular graphs, Combinatorica, 11(4) (1991), 331-362.
15. J. Friedman, A Proof of Alon's Second Eigenvalue Conjecture and Related Problem, Memoirs of the American Mathematical Society 2008, 100 pp.
16. Z. Füredi and J. Komlós. The eigenvalues of random symmetric matrices, Combinatorica, 1(3) 1981, 233-241.
17. M. Krivelevich and B. Sudakov, The largest eigenvalue of sparse random graphs, Combin. Probab. Comput., 12 (2003), 61-72.
18. R. Oliveira, Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges, [math. CO].
19. J. Tropp, User-friendly tail bounds for sums of random matrices, Found. Comput. Math., 12(4) 2012, 389-434.
20. V. H. Vu, Spectral norm of random matrices, Combinatorica, 27 (6) (2007), 721-736.
21. E. P. Wigner, On the distribution of the roots of certain symmetric matrices, Ann. Math., 67 (1958), 325-327.