Fetching the paper…
Reading the bibliography…
We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph.
P. Erdős, On a lemma of Littlewood and Offord
1945
Earlier work this paper cites.
J. von Neumann, H.H. Goldstine. Numerical inverting of matrices of high order
1947
Earlier work this paper cites.
W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables
1963
Earlier work this paper cites.
J. von Neumann. Collected works. Vol. V: Design of computers, theory of automata and numerical analysis
1963
Earlier work this paper cites.
D.J. Kleitman, On a Lemma of Littlewood and Offord on the Distributions of Linear Combinations of Vectors
1970
Earlier work this paper cites.
B. S. Kashin, Diameters of some finite-dimensional sets and classes of smooth functions
1977
Earlier work this paper cites.
S. Smale, On the efficiency of algorithms of analysis
1985
Earlier work this paper cites.
N. Tomczak-Jaegermann, Banach-Mazur distances and finite-dimensional operator ideals
1989
Earlier work this paper cites.
M. Ledoux, M. Talagrand, Probability in Banach spaces. Isoperimetry and processes
1991
Earlier work this paper cites.
D. Bau, L. Trefethen, Numerical linear algebra
1997
Earlier work this paper cites.
K.R. Davidson, S.J. Szarek, Local operator theory, random matrices and Banach spaces
2001
Earlier work this paper cites.
D. A. Spielman and S.-H. Teng, Smoothed analysis of algorithms
2002
Earlier work this paper cites.
A. E. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, R. Vershynin, Random Euclidean embeddings in spaces of bounded volume ratio,
2004
Earlier work this paper cites.
G. Schechtman, Special orthogonal splittings of L 1 2 k L_{1}^{2k}
2004
Earlier work this paper cites.
A.E. Litvak, A. Pajor, M. Rudelson, and N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes,
2005
Earlier work this paper cites.
A. Sankar, D. A. Spielman and S.-H. Teng, Smoothed analysis of the condition numbers and growth factors of matrices
2006
Earlier work this paper cites.
T. Tao and V. Vu, The condition number of a randomly perturbed matrix
2007
Cited alongside, same era.
K.P. Costello and V. Vu, The rank of random graphs, Random Structures Algorithms
2008
Cited alongside, same era.
M. Rudelson, R. Vershynin, The Littlewood-Offord problem and invertibility of random matrices,
2008
Cited alongside, same era.
V. Vu, Random discrete matrices
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, Smallest singular value of a random rectangular matrix
2009
Cited alongside, same era.
T. Tao, V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
2009
Cited alongside, same era.
S. Mendelson, G. Paouris, On singular values of matrices
2014
Later among the works it cites.
V.H. Vu, Combinatorial problems in random matrix theory
2014
Later among the works it cites.
P. Yaskov, Lower bounds on the smallest eigenvalue of a sample covariance matrix
2014
Later among the works it cites.
V. Koltchinskii, S. Mendelson, Bounding the smallest singular value of a random matrix without concentration
2015
Later among the works it cites.
2015
Later among the works it cites.
A.E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef, Anti-concentration property for random digraphs and invertibility of their adjacency matrices
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Adamczak, A.E. Litvak, A. Pajor, N. Tomczak-Jaegermann, Quantitative estimates of the convergence of the empirical covariance matrix in log-concave Ensembles,
2010
Cited alongside, same era.
Z. Bai and J. W. Silverstein, Spectral analysis of large dimensional random matrices
2010
Cited alongside, same era.
M. Rudelson, R. Vershynin, Non-asymptotic theory of random matrices: extreme singular values
2010
Cited alongside, same era.
T. Tao and V. Vu, Smooth analysis of the condition number and the least singular value
2010
Cited alongside, same era.
R. Adamczak, O. Guedon, A.E. Litvak, A. Pajor, N. Tomczak-Jaegermann, Condition number of a square matrix with i.i.d. columns drawn from a convex body,
2012
Cited alongside, same era.
C. Bordenave and D. Chafaï, Around the circular law
2012
Cited alongside, same era.
2016
Later among the works it cites.
R.I. Oliveira, The lower tail of random quadratic forms, with applications to ordinary least squares and restricted eigenvalue properties
2016
Later among the works it cites.
A. Basak, M. Rudelson, Invertibility of sparse non-hermitian matrices
2017
Closest in time.
N. A. Cook, Discrepancy properties for random regular digraphs, Random Structures Algorithms 50
2017
Closest in time.
N. A. Cook, On the singularity of adjacency matrices for random regular digraphs, Probab. Theory Related Fields 167
2017
Closest in time.
L. Erdös, H.-T. Yau, A Dynamical Approach to Random Matrix Theory
2017
Closest in time.
O. Guedon, A. E. Litvak, A. Pajor, N. Tomczak-Jaegermann, On the interval of fluctuation of the singular values of random matrices, J. Eur. Math. Soc. (JEMS) 19
2017
Closest in time.
A.E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef, Adjacency matrices of random digraphs: singularity and anti-concentration
2017
Closest in time.
A. Basak, N. Cook, O. Zeitouni, Circular law for the sum of random permutation matrices
2018
Closest in time.
A.E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef, The rank of random regular digraphs of constant degree
2018
Closest in time.
T. Tao and V. Vu, Random matrices: universality of ESDs and the circular law,
2065
Closest in time.