Invertibility of symmetric random matrices
From MaRDI portal
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.
Recommendations
- Invertibility of random matrices: norm of the inverse
- The inverse Riesz probability distribution on symmetric matrices
- Invertibility of random matrices: Unitary and orthogonal perturbations
- Quantitative invertibility of random matrices: a combinatorial perspective
- An inverse problem for symmetric doubly stochastic matrices
- The asymptotic probability that a random biased matrix is invertible
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Distribution of the generalised inverse of a random matrix and its applications
- The eigenvalues of random symmetric matrices
Cites work
- A correlation inequality for bipartite graphs
- Asymptotic expansions for bivariate von Mises functionals
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- Invertibility of random matrices: norm of the inverse
- On the Probability That a Random ± 1-Matrix Is Singular
- On the singularity probability of discrete random matrices
- Random matrices: localization of the eigenvalues and the necessity of four moments
- Random matrices: The distribution of the smallest singular values
- Random matrices: universality of local eigenvalue statistics
- Random matrices: Universality of local eigenvalue statistics up to the edge
- Random symmetric matrices are almost surely nonsingular.
- Smallest singular value of a random rectangular matrix
- Some estimates of norms of random matrices
- The Littlewood-Offord problem and invertibility of random matrices
- Wegner Estimate and Level Repulsion for Wigner Random Matrices
Cited in
(88)- Random matrices: overcrowding estimates for the spectrum
- Random matrices have simple spectrum
- Asymptotic Lyapunov exponents for large random matrices
- Fixed energy universality of Dyson Brownian motion
- Low-degree factors of random polynomials
- Toward the history of the Saint St. Petersburg school of probability and statistics. I: Limit theorems for sums of independent random variables
- Bilinear and quadratic variants on the Littlewood-Offord problem
- Singularity of random symmetric matrices -- simple proof
- Sparse random matrices have simple spectrum
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- On the singularity of random symmetric matrices
- Recent progress in combinatorial random matrix theory
- Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs
- On the permanent of a random symmetric matrix
- Invertibility of adjacency matrices for random d-regular graphs
- Tail bounds for gaps between eigenvalues of sparse random matrices
- Spectrum and pseudospectrum for quadratic polynomials in Ginibre matrices
- Spectrum of heavy-tailed elliptic random matrices
- On eigenvalue distributions of large autocovariance matrices
- Smallest singular value and limit eigenvalue distribution of a class of non-Hermitian random matrices with statistical application
- Determinants of Seidel matrices and a conjecture of Ghorbani
- The circular law for sparse non-Hermitian matrices
- Small-deviation inequalities for sums of random matrices
- On the concentration of random multilinear forms and the universality of random block matrices
- Invertibility of random matrices: norm of the inverse
- Concentration of distances in Wigner matrices
- Random doubly stochastic matrices: the circular law
- The Littlewood-Offord problem and invertibility of random matrices
- Arak's inequalities for concentration functions and the Littlewood-Offord problem
- Random matrices, geometric functional analysis and algorithms. Abstracts from the workshop held May 1--7, 2011.
- Smoothed analysis of symmetric random matrices with continuous distributions
- On the Littlewood-Offord problem
- On a Conjecture of Godsil Concerning Controllable Random Graphs
- Matrix regularizing effects of Gaussian perturbations
- Adjacency matrices of random digraphs: singularity and anti-concentration
- Hitting Time Theorems for Random Matrices
- Reciprocal matrices with random coefficients
- Explicit lower and upper bounds on the entangled value of multiplayer XOR games
- Simple bounds for recovering low-complexity models
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- A central limit theorem for the determinant of a Wigner matrix
- The inverse Riesz probability distribution on symmetric matrices
- On the least singular value of random symmetric matrices
- Concentration of the Frobenius norm of generalized matrix inverses
- Eigenvectors of random matrices of symmetric entry distributions
- l_p-recovery of the most significant subspace among multiple subspaces with outliers
- Surjectivity of near-square random matrices
- Resilience of the rank of random matrices
- Controllability of network opinion in Erdös-Rényi graphs using sparse control inputs
- Some new results in random matrices over finite fields
- Polynomial threshold functions, hyperplane arrangements, and random tensors
- A bound for the maximal probability in the Littlewood-Offord problem
- Singularity of random symmetric matrices revisited
- Random Toeplitz matrices: The condition number under high stochastic dependence
- Invertibility via distance for noncentered random matrices with continuous distributions
- Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
- Invertibility of sparse non-Hermitian matrices
- Arak inequalities for concentration functions and the Littlewood-Offord problem
- Random matrices: tail bounds for gaps between eigenvalues
- On a problem of Farrell and Vershynin in random matrix theory
- The distribution of sandpile groups of random graphs
- Invertibility of random matrices: Unitary and orthogonal perturbations
- Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
- On the smallest singular value of symmetric random matrices
- Iterative hard thresholding for low CP-rank tensor models
- Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- The smallest singular value of a shifted random matrix
- Quantitative invertibility of non-Hermitian random matrices
- Spectral measure of empirical autocovariance matrices of high-dimensional Gaussian stationary processes
- The least singular value of a random symmetric matrix
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- A large deviation inequality for the rank of a random matrix
- The singularity probability of a random symmetric matrix is exponentially small
- Emergence of near-TAP free energy functional in the SK model at high temperature
- Concentration of equilibria and relative instability in disordered non-relaxational dynamics
- Phase transition for the bottom singular vector of rectangular random matrices
- Eigenvalue gaps of random perturbations of large matrices
- Singularity degree of structured random matrices
- Local and global universality of random matrix cokernels
- Partial estimation of covariance matrices
- The rank of random regular digraphs of constant degree
- On the rank of a random symmetric matrix in the large-deviation regime
- No-gaps delocalization for general random matrices
- Approximation properties of certain operator-induced norms on Hilbert spaces
- Random symmetric matrices are almost surely nonsingular.
- On the number of integral graphs
This page was built for publication: Invertibility of symmetric random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409860)
