Invertibility of symmetric random matrices

Abstract

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the spectrum of H is delocalized on the optimal scale o(n^{-1/2}). These results improve upon a polynomial singularity bound due to Costello, Tao and Vu, and they generalize, up to constant factors, results of Tao and Vu, and Erdos, Schlein and Yau.

53 pages. Minor corrections, changes in presentation. To appear in Random Structures and Algorithms

References in corpus (1)

• Random matrices: Localization of the eigenvalues and the necessity of four moments

Cited by in corpus (5)

• Random doubly stochastic matrices: The circular law
• The distribution of sandpile groups of random graphs
• Random matrices: Universal properties of eigenvectors
• Invertibility of random matrices: unitary and orthogonal perturbations
• On the singularity of random combinatorial matrices