The rank of random graphs

Random Structures and Algorithms

Volumn 33, Issue 3, 2008, Pages 269-285

  Costello, Kevin P ^a   Vu, H Van ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Littlewood offord; Random graph; Random matrix

Indexed keywords

EID: 53349143946     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20219     Document Type: Article

References (8)

1. K. Costello, T. Tao, and V. Vu, Random symmetric matrices are almost surely non-singular, Duke Math J 135 (2006), 395-413.
2. K. Costello and V. Vu, On the rank of random sparse matrices, (submitted).
3. P. Erdös, On a lemma of Littlewood and Offord, Bull Amer Math Soc 51 ( 1945), 898-902.
4. G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Period Math Hungar 8 (1977), 197-211.
5. J. Komlós, On the determinant of (0,1) matrices, Studia Sci Math Hungar 2 (1967), 7-22.
6. J. Kahn, J. Komlós, and E. Szemerédi, On the probability a random ±1 matrix is singular, I Amer Math Soc 8 (1995), 223-240.
7. T. Tao and V. Vu, On random ±1 matrices: Singularity and determinant, Random Structures Algorithms 28 (2006), 1-23.
8. T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, J Amer Math Soc 20 (2007), 603-628.