Upper bound for intermediate singular values of random matrices
classification
🧮 math.PR
keywords
boundfracmatrixsqrtcasecenteredcombinationentries
read the original abstract
In this paper, we prove that an $n\times n$ matrix $A$ with independent centered subgaussian entries satisfies \[ s_{n+1-l}(A) \le C_1t \frac{l}{\sqrt{n}} \] with probability at least $1-\exp(-C_2tl)$. This yields $s_{n-l}(A) \sim \frac{cl}{\sqrt{n}}$ in combination with a known lower bound. These results can be generalized to the rectangular matrix case.
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.