An upper bound on the smallest singular value of a square random matrix
classification
🧮 math.PR
keywords
boundupperassumptionentriesmathbbmatrixsingularsmallest
read the original abstract
Let $A = (a_{ij})$ be a square $n\times n$ matrix with i.i.d. zero mean and unit variance entries. Rudelson and Vershynin showed that the upper bound for a smallest singular value $s_n(A)$ is of order $n^{-\frac12}$ with probability close to one under additional assumption on entries of $A$ that $\mathbb{E}a^4_{11} < \infty$. We remove the assumption on the fourth moment and show the upper bound assuming only $\mathbb{E}a^2_{11} = 1.$
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.