Fetching the paper…
Reading the bibliography…
An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $\eta \geq 0$, $\Pr(s_n(M_n) \leq \eta) \lesssim n^{C}\eta + \exp(-n^{c})$.
On the limit of the largest eigenvalue of the large dimensional sample covariance matrix
Y.-Q. Yin, Z.-D. Bai, and P. R. Krishnaiah · 1904
Earlier work this paper cites.
On the Kolmogorov-Rogozin inequality for the concentration function
C. Esseen · 1966
Earlier work this paper cites.
On determinant of (0, 1) matrices
J. Komlós · 1967
Earlier work this paper cites.
A note on the largest eigenvalue of a large dimensional sample covariance matrix
Z. D. Bai, J. W. Silverstein, and Y. Q. Yin · 1988
Earlier work this paper cites.
Eigenvalues and condition numbers of random matrices
A. Edelman · 1988
Earlier work this paper cites.
On the probability that a random ± \pm 1-matrix is singular
J. Kahn, J. Komlós, and E. Szemerédi · 1995
Earlier work this paper cites.
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
D. A. Spielman and S.-H. Teng · 2004
Earlier work this paper cites.
Some estimates of norms of random matrices
R. Latała · 2005
Earlier work this paper cites.
Smallest singular value of random matrices and geometry of random polytopes
A. E. Litvak, A. Pajor, M. Rudelson, and N. Tomczak-Jaegermann · 2005
Earlier work this paper cites.
Random symmetric matrices are almost surely nonsingular
K. P. Costello, T. Tao, and V. H. Vu · 2006
Earlier work this paper cites.
Additive combinatorics
T. Tao and V. H. Vu · 2006
Earlier work this paper cites.
On the singularity probability of random Bernoulli matrices
T. Tao and V. H. Vu · 2007
Earlier work this paper cites.
Invertibility of random matrices: norm of the inverse
M. Rudelson · 2008
Earlier work this paper cites.
The Littlewood–Offord problem and invertibility of random matrices
M. Rudelson and R. Vershynin · 2008
Cited alongside, same era.
Random matrices: the circular law
T. Tao and V. Vu · 2008
Cited alongside, same era.
Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
T. Tao and V. H. Vu · 2009
Cited alongside, same era.
Non-asymptotic theory of random matrices: extreme singular values
M. Rudelson and R. Vershynin · 2010
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
R. Vershynin · 2010
Cited alongside, same era.
On the singularity of adjacency matrices for random regular digraphs
N. A. Cook · 2017
Later among the works it cites.
Adjacency matrices of random digraphs: singularity and anti-concentration
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2017
Later among the works it cites.
The smallest singular value of a shifted d-regular random square matrix
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2017
Later among the works it cites.
Invertibility of adjacency matrices for random d d -regular graphs
J. Huang · 2018
Later among the works it cites.
Anticoncentration for subgraph statistics
M. Kwan, B. Sudakov, and T. Tran · 2018
Later among the works it cites.
The distribution of sandpile groups of random regular graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. H. Nguyen and V. Vu · 2012
Cited alongside, same era.
Topics in random matrix theory
T. Tao · 2012
Cited alongside, same era.
On the singularity of random combinatorial matrices
H. H. Nguyen · 2013
Cited alongside, same era.
Small ball probability, inverse theorems, and applications
H. H. Nguyen and V. H. Vu · 2013
Cited alongside, same era.
Lecture notes on non-asymptotic theory of random matrices
M. Rudelson · 2013
Cited alongside, same era.
Analysis of Boolean functions
R. O’Donnell · 2014
Cited alongside, same era.
Invertibility of symmetric random matrices
R. Vershynin · 2014
Cited alongside, same era.
A. Mészáros · 2018
Later among the works it cites.
Nonsingularity of adjacency matrices of random r r -regular graphs
H. H. Nguyen and M. M. Wood · 2018
Later among the works it cites.
Coverings of random ellipsoids, and invertibility of matrices with iid heavy-tailed entries
E. Rebrova and K. Tikhomirov · 2018
Later among the works it cites.
Singularity of random Bernoulli matrices
K. Tikhomirov · 2018
Later among the works it cites.
On the counting problem in inverse Littlewood–Offord theory
A. Ferber, V. Jain, K. Luh, and W. Samotij · 2019
Closest in time.
Approximate Spielman-Teng theorems for random matrices with heavy tailed entries: a combinatorial view
V. Jain · 2019
Closest in time.
Smoothed analysis of the condition number without inverse Littlewood-Offord theory
V. Jain · 2019
Closest in time.
Fixed energy universality of Dyson Brownian motion
B. Landon, P. Sosoe, and H.-T. Yau · 2019
Closest in time.