Small Ball Probability for the Condition Number of Random Matrices

@article{Litvak2019SmallBP,
  title={Small Ball Probability for the Condition Number of Random Matrices},
  author={Alexander E. Litvak and Konstantin E. Tikhomirov and Nicole Tomczak-Jaegermann},
  journal={Lecture Notes in Mathematics},
  year={2019}
}
Let A be an n × n random matrix with i.i.d. entries of zero mean, unit variance and a bounded sub-Gaussian moment. We show that the condition number \(s_{\max }(A)/s_{\min }(A)\) satisfies the small ball probability estimate $$\displaystyle {\mathbb P}\big \{s_{\max }(A)/s_{\min }(A)\leq n/t\big \}\leq 2\exp (-c t^2),\quad t\geq 1, $$ where c > 0 may only depend on the sub-Gaussian moment. Although the estimate can be obtained as a combination of known results and techniques, it was not… 
View PDF on arXiv
4 Citations
Background Citations
1
Methods Citations
1

4 Citations

Large-deviation asymptotics of condition numbers of random matrices

Two main ingredients are proposed to relate the large-deviation probabilities of k(p,n) to those involving n independent and identically distributed random variables, which enables us to consider a quite general distribution of the entries (namely the sub-Gaussian distribution), and to control, for standard normal entries, the upper tail of k (p, n) using the upper tails of ratios of two independent $\chi^2$ random variables.

A note on restricted invertibility with weighted columns

The restricted invertibility theorem was originally introduced by Bourgain and Tzafriri in $1987$ and has been considered as one of the most celebrated theorems in geometry and analysis. In this…

Random Toeplitz Matrices: The Condition Number under High Stochastic Dependence

This paper uses a circulant embedding as a decoupling technique to break the stochastic dependence of the structure of the Toeplitz matrix and reduce the problem to analyze the extreme singular values of a randomcirculant matrix.

Average-case analysis of the Gaussian Elimination with Partial Pivoting

A (partial) theoretical justification of this phenomenon is obtained by showing that, given the random n × n standard Gaussian coefficient matrix A, the growth factor of the Gaussian Elimination with Partial Pivoting is at most polynomially large in n with probability close to one.

24 References

Lower bounds for the smallest singular value of structured random matrices

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex…

Upper bound for intermediate singular values of random matrices

An upper bound on the smallest singular value of a square random matrix

Condition numbers of random matrices

  • S. Szarek
  • Mathematics, Computer Science
    J. Complex.
  • 1991

The sparse circular law under minimal assumptions

The circular law asserts that the empirical distribution of eigenvalues of appropriately normalized $${n \times n}$$n×n matrix with i.i.d. entries converges to the uniform measure on the unit disc as…

Restricted Invertibility Revisited

Suppose that \(m,n \in \mathbb{N}\) and that \(A: \mathbb{R}^{m} \rightarrow \mathbb{R}^{n}\) is a linear operator. It is shown here that if \(k,r \in \mathbb{N}\) satisfy \(k <r\leqslant…

Inverse Littlewood-Offord theorems and the condition number of random discrete matrices

Consider a random sum r)\V\ + • • • + r]nvn, where 771, . . . , rin are independently and identically distributed (i.i.d.) random signs and vi, . . . , vn are integers. The Littlewood-Offord problem…

The least singular value of a random square matrix is O(n−1/2)

The Littlewood-Offord problem and invertibility of random matrices

Adjacency matrices of random digraphs: singularity and anti-concentration