The rank of diluted random graphs

Annals of Probability

Volumn 39, Issue 3, 2011, Pages 1097-1121

  Bordenave, Charles ^a   Lelarge, Marc ^b   Salez, Justin ^b  

^a INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

^b INRIA   (France)

Author keywords

Adjacency matrix; Karp and Sipser algorithm; Local weak convergence; Random graphs; Random matrices

Indexed keywords

EID: 79953133890     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/10-AOP567     Document Type: Article

References (19)

1. AIZENMAN, M., SIMS, R. and WARZEL, S. (2006). Stability of the absolutely continuous spectrum of random Schrödinger operators on tree graphs. Probab. Theory Related Fields 136 363-394.
2. ALDOUS, D. and LYONS, R. (2007). Processes on unimodular random networks. Electron. J. Probab. 12 1454-1508.
3. ALDOUS, D. and STEELE, J. M. (2004). The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures. Encyclopaedia Math. Sci. 110 1-72. Springer, Berlin.
4. BAI, Z. D. and SILVERSTEIN, J. W. (2006). Spectral Analysis of Large Dimensional Random Matrices. Mathematics Monograph Series 2. Science Press, Beijing.
5. BAUER, M. and GOLINELLI, O. (2000). On the kernel of tree incidence matrices. J. Integer Seq. 3 Art. 00.1.4, 1 HTML document (electronic).
6. BAUER, M. and GOLINELLI, O. (2001). Exactly solvable model with two conductor-insulator transitions driven by impurities. Phys. Rev. Lett. 86 2621-2624.
7. BENJAMINI, I. and SCHRAMM, O. (2001). Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6 13 pp. (electronic).
8. BHANIDI, S., EVANS, S. N. and SEN, A. (2009). Spectra of large random trees. Preprint.
9. BOHMAN, T. and FRIEZE, A. (2010). Karp-Sipser on random graphs with a fixed degree sequence.
10. BORDENAVE, C. and LELARGE, M. (2010). Resolvent of large random graphs. Random Structures and Algorithms 37 332-352.
11. BORDENAVE, C., LELARGE, M. and SALEZ, J. (2010).Matchings on infinite graphs. Preprint.
12. COSTELLO, K. P. and VU, V. H. (2008). The rank of random graphs. Random Structures Algorithms 33 269-285.
13. COSTELLO, K. P., TAO, T. and VU, V. (2006). Random symmetric matrices are almost surely nonsingular. Duke Math. J. 135 395-413.
14. CVETKOVIĆ, D. M., DOOB, M. and SACHS, H. (1995). Spectra of Graphs: Theory and Applications, 3rd ed. Johann Ambrosius Barth, Heidelberg.
15. KARP, R. and SIPSER, M. (1981). Maximum matchings in sparse random graphs. In Proc. of the Twenty-Second IEEE Annual Symposium on Foundations of Computer Science 364-375. IEEE Computer Soc., Los Angeles, CA.
16. KHORUNZHY, O., SHCHERBINA, M. and VENGEROVSKY, V. (2004). Eigenvalue distribution of large weighted random graphs. J. Math. Phys. 45 1648-1672.
17. KLEIN, A. (1998). Extended states in the Anderson model on the Bethe lattice. Adv. Math. 133 163-184.
18. REED, M. and SIMON, B. (1972). Methods of Modern Mathematical Physics. I. Functional Analysis. Academic Press, New York.
19. ZDEBOROVÁ, L. and MÉZARD, M. (2006). The number of matchings in random graphs. J. Stat. Mech. Theory Exp. 5 P05003, 24 pp. (electronic).