Smallest singular value of sparse random matrices
From MaRDI portal
Abstract: We extend probability estimates on the smallest singular value of random matrices with independent entries to a class of sparse random matrices. We show that one can relax a previously used condition of uniform boundedness of the variances from below. This allows us to consider matrices with null entries or, more generally, with entries having small variances. Our results do not assume identical distribution of the entries of a random matrix and help to clarify the role of the variances of the entries. We also show that it is enough to require boundedness from above of the -th moment, , of the corresponding entries.
Recommendations
- On the largest and the smallest singular value of sparse rectangular random matrices
- The smallest singular value of random rectangular matrices with no moment assumptions on entries
- Universality of the least singular value for sparse random matrices
- Smallest singular value of a random rectangular matrix
- Lower bounds for the smallest singular value of structured random matrices
Cited in
(25)- Smallest singular value of a random rectangular matrix
- Structure of eigenvectors of random regular digraphs
- The probabilistic estimates on the largest and smallest q-singular values of random matrices
- Singularity of sparse Bernoulli matrices
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Extreme singular values of inhomogeneous sparse random rectangular matrices
- The smallest singular value of random rectangular matrices with no moment assumptions on entries
- Asymptotic geometric analysis: achievements and perspective
- On the decay of the smallest singular value of submatrices of rectangular matrices
- Invertibility of sparse non-Hermitian matrices
- Lower bounds for the smallest singular value of structured random matrices
- Length Bounds for Singular Values of Sparse Matrices
- Universality of the least singular value for the sum of random matrices
- Circular law for sparse random regular digraphs
- The smallest singular value of inhomogeneous square random matrices
- Single-pass randomized algorithms for LU decomposition
- Random polytopes obtained by matrices with heavy-tailed entries
- Randomized algorithms for the low multilinear rank approximations of tensors
- Universality of the least singular value for sparse random matrices
- Sharp lower bounds on the least singular value of a random matrix without the fourth moment condition
- Smallest singular value of random matrices with independent columns
- Randomized LU decomposition
- Smallest singular value of random matrices and geometry of random polytopes
- Tail bounds for gaps between eigenvalues of sparse random matrices
- On the largest and the smallest singular value of sparse rectangular random matrices
This page was built for publication: Smallest singular value of sparse random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4900177)