arXiv Analytics

Sign in

arXiv:1909.04219 [math.PR]AbstractReferencesReviewsResources

The smallest singular value of inhomogeneous square random matrices

Galyna V. Livshyts, Konstantin Tikhomirov, Roman Vershynin

Published 2019-09-10Version 1

We show that for an $n\times n$ random matrix $A$ with independent uniformly anti-concentrated entries, such that $\mathbb{E} ||A||^2_{HS}\leq K n^2$, the smallest singular value $\sigma_n(A)$ of $A$ satisfies $$ P\left( \sigma_n(A)\leq \frac{\varepsilon}{\sqrt{n}} \right) \leq C\varepsilon+2e^{-cn},\quad \varepsilon \ge 0. $$ This extends earlier results \cite{RudVer-square, RebTikh} by removing the assumption of mean zero and identical distribution of the entries across the matrix, as well as the recent result \cite{Liv} where the matrix was required to have i.i.d. rows. Our model covers "inhomogeneus" matrices allowing different variances of the entries, as long as the sum of the second moments is of order $O(n^2)$. As a crucial element of the proof, we introduce the notion of the Randomized Least Common Denominator (RLCD) which allows to study anti-concentration properties of weighted sums of independent but not identically distributed variables.

Related articles: Most relevant | Search more
arXiv:1811.07038 [math.PR] (Published 2018-11-16, updated 2018-12-24)
The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
arXiv:1312.3580 [math.PR] (Published 2013-12-12)
Bounding the smallest singular value of a random matrix without concentration
arXiv:2211.03975 [math.PR] (Published 2022-11-08)
Optimal Smoothed Analysis and Quantitative Universality for the Smallest Singular Value of Random Matrices