Invertibility of symmetric random matrices

Random Structures and Algorithms

Volumn 44, Issue 2, 2014, Pages 135-182

  Vershynin, Roman ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Invertibility problem; Singularity probability; Symmetric random matrices

Indexed keywords

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

References (23)

1. N. Alon and J. Spencer, The probabilistic method, 2nd edition, Wiley-Interscience, New York, 2000.
2. J. Bourgain, V. Vu, and P. Wood, On the singularity probability of discrete random matrices, J Funct Anal, 258, 2010, 559-603.
3. K. Costello, Bilinear and quadratic variants on the Littlewood-Offord problem, 2009, Submitted for Publication (2009).
4. K. Costello, T. Tao and, V. Vu, Random symmetric matrices are almost surely non-singular, Duke Math J, 135, 2006, 395-413.
5. L. Erdös, B. Schlein, and H.-T. Yau, Wegner estimate and level repulsion for Wigner random matrices, Int Math Res Not, 3, 2010, 436-479.
6. F. Götze, Asymptotic expansions for bivariate von Mises functionals, Z Wahrsch Verw Gebiete 50 1979, 333-355.
7. J. Kahn, J. Komlós, and E. Szemerédi, On the probability that a random ±1-matrix is singular, J Am Math Soc, 8, (1995), 223-240.
8. R. Latala, Some estimates of norms of random matrices, Proc Am Math Soc 133 (2005), 1273-1282.
9. H. Nguyen, Inverse Littlewood-Offord problems and the singularity of random symmetric matrices, Duke Math J (in press).
10. H. Nguyen, On the least singular value of random symmetric matrices, Submitted for Publication.
11. M. Rudelson, Invertibility of random matrices: Norm of the inverse, Ann Math 168 (2008), 575-600.
12. M. Rudelson and, R. Vershynin, The Littlewood-Offord Problem and invertibility of random matrices, Adv Math 218 (2008), 600-633.
13. M. Rudelson and, R. Vershynin, Smallest singular value of a random rectangular matrix, Commun Pure Appl Math 62 (2009), 1707-1739.
14. M. Rudelson and, R. Vershynin, Non-asymptotic theory of random matrices: Extreme singular values, In Proceedings of the International Congress of Mathematicians, Hyderabad, India, 2010.
15. A. Sidorenko, A correlation inequality for bipartite graphs, Graphs Combin 9 1993, 201-204.
16. T. Tao and, V. Vu, Additive combinatorics, In Cambridge Studies in Advanced Mathematics, 105, Cambridge University Press, Cambridge, 2006.
17. T. Tao and, V. Vu, From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices, Bull Am Math Soc 46 2009, 377-396.
18. T. Tao and, V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Ann Math 169 2009, 595-632.
19. T. Tao and, V. Vu, Random matrices: The distribution of the smallest singular values, Geom Funct Anal 20 2010, 260-297.
20. T. Tao and, V. Vu, Random matrices: Universality of local eigenvalue statistics up to the edge, Comm Math Phys, 298 (2010), 549-572.
21. T. Tao and, V. Vu, Random matrices: Universality of local eigenvalue statistics, Acta Math 206 (2011), 127-204.
22. T. Tao and V. Vu, Random matrices: Localization of the eigenvalues and the necessity of four moments, Acta Math Vietnam 36 (2011), 431-449.
23. R. Vershynin, Introduction to the non-asymptotic analysis of random matrices, In Y. Eldar and G. Kutyniok (Editors), Compressed sensing: Theory and Applications, Cambridge University Press, in press.