Low eigenvalues of Laplacian matrices of large random graphs

Probability Theory and Related Fields

Volumn 153, Issue 3-4, 2012, Pages 671-690

  Jiang, Tiefeng ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Extreme eigenvalues; Laplacian matrix; Order statistics; Random graph; Random matrix

Indexed keywords

EID: 84864392145     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-011-0357-4     Document Type: Article

References (28)

1. Bahatia, R.: Matrix analysis. In: Graduate Texts in Mathematics, vol. 169. Springer, Berlin (1997).
2. Bai Z.: Methodologies in spectral analysis of large dimensional random matrices: a review. Stat. Sin. 9, 611-677 (1999).
3. Bauer M., Golinelli O.: Random incidence matrices: moments of the spectral density. J. Stat. Phys. 103, 301-337 (2001).
4. Bollobás B.: Random Graphs. Academic Press, New York (1985).
5. Bordenave C., Caputo P., Chafaï D.: Spectrum of large random reversible Markov chains: two examples. Latin Am. J. Probab. Math. Stat. 7, 41-64 (2010).
6. Bryc W., Dembo A., Jiang T.: Spectral measure of large random Hankel, Markov and Toeplitz matrices. Ann. Probab. 34, 1-38 (2006).
7. Chung, F.: Spectral graph theory. In: CBMS Regional Conference Series in Mathematics, vol. 92. American Mathematical Society (1997).
8. Chung, F., Lu, L.: Complex graphs and networks. In: CBMS Regional Conference Series in Mathematics, vol. 107. American Mathematical Society (2006).
9. Colin de Verdière, Y.: Spectres de Graphes. Societe Mathematique De France (1998).
10. David, H., Nagaraja, H.: Order Statistics, 3rd edn. Wiley-Interscience (2003).
11. Ding X., Jiang T.: Spectral distributions of adjacency and Laplacian matrices of weighted random graphs. Ann. Appl. Probab. 20(6), 2086-2117 (2010).
12. Durrett, R.: Random Graph Dynamics. Cambridge University Press (2006).
13. Erdös P., Rényi A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kuató Int. Közl 5, 17-61 (1960).
14. Erdös P., Rényi A.: On random graphs I. Publ. Math. Debrecen. 6, 290-297 (1959).
15. Horn, R., Johnson, C.: Matrix Analysis. Cambridge Univesity Press (1985).
16. Fiedler M.: Algebraic connectivity of graphs (English). Czechoslov. Math. J. 23(2), 298-305 (1973).
17. Janson S., Łuczak T., Ruciński A.: Random Graphs. Wiley, New York (2000).
18. Khorunzhy O., Shcherbina M., Vengerovsky V.: Eigenvalue distribution of large weighted random graphs. J. Math. Phys. 45(4), 1648-1672 (2004).
19. Khorunzhy A., Khoruzhenko B., Pastur L., Shcherbina M.: The Large n-limit in Statistical Mechanics and the Spectral Theory of Disordered Systems, Phase Transition and Critical Phenomenon, vol. 15, pp. 73. Academic, New York (1992).
20. Kirchhoff G.: Über die Auflösung der Gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer Ströme geföhrt wird. Ann. Phys. Chem. 72, 497-508 (1847).
21. Kolchin V.: Random Graphs. Cambridge University Press, New York (1998).
22. Lin Z., Bai Z.: Probability Inequalities, 1st edn. Springer, Berlin (2011).
23. Mohar, B.: In: Alavi, Y., Chartrand, G., Oellermann, O. R., Schwenk, A. J. (eds.) Graph Theory, Combinatorics, and Applications, vol. 2, pp. 871-898. Wiley, New York (1991).
24. Palmer E.: Graphical Evolution: An Introduction to the Theory of Random Graphs. Wiley, New York (1985).
25. Rogers G., De Dominicis C.: Density of states of sparse random matrices. J. Phys. A: Math. Gen. 23, 1567-1573 (1990).
26. Rogers G., Bray A.: Density of states of a sparse random matrix. Phys. Rev. B. 37, 3557-3562 (1988).
27. Sakhanenko, A.: On the accuracy of normal approximation in the invariance principle [translation of Trudy Inst. Mat. (Novosibirsk) 13 (1989), Asimptot. Analiz Raspred. Sluch. Protsess., 40-66; MR 91d: 60082]. Sib. Adv. Math. 1(4), 58-91 (1991).
28. Sakhanenko, A.: Estimates in an invariance principle. In: Limit Theorems of Probability Theory. Trudy Inst. Mat., vol. 5, pp. 27-44, 175. "Nauka" Sibirsk. Otdel, Novosibirsk (1985).