Fetching the paper…
Reading the bibliography…
Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components.
M. Campos, L. Mattos, R. Morris and N. Morrison, On the singularity of random symmetric matrices
1904
Earlier work this paper cites.
1904
Earlier work this paper cites.
1904
Earlier work this paper cites.
B. Roos, New inequalities for permanents and hafnians and some generalizations
1906
Earlier work this paper cites.
1909
Earlier work this paper cites.
J. von Neumann and H. H. Goldstine, Numerical inverting of matrices of high order
1947
Earlier work this paper cites.
C. G. Esséen, On the Kolmogorov-Rogozin inequality for the concentration function
1966
Earlier work this paper cites.
G. Halász, Estimates for the concentration function of combinatorial number theory and probability
1977
Earlier work this paper cites.
S. Smale, On the efficiency of algorithms of analysis
1985
Earlier work this paper cites.
A. Edelman, Eigenvalues and condition numbers of random matrices
1988
Earlier work this paper cites.
S. Szarek, Condition numbers of random matrices
1991
Earlier work this paper cites.
J. Kahn, J. Komlós and E. Szemerédi, On the probability that a random ± 1 \pm 1 matrix is singular
1995
Earlier work this paper cites.
J. Huang, D. McKinnon, M. Satriano, What fraction of an S n S_{n} -orbit can lie on a hyperplane?
2001
Earlier work this paper cites.
B. Pawlowski, The fraction of an S n S_{n} -orbit on a hyperplane
2002
Earlier work this paper cites.
A. E. Litvak and K. Tikhomirov, Singularity of random sparse Bernoulli matrices
2004
Earlier work this paper cites.
D. A. Spielman and S.-H. Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
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.
V. H. Vu, Recent progress in combinatorial random matrix theory
2005
Earlier work this paper cites.
P. Good, Permutation, parametric, and bootstrap tests of hypotheses
2006
Cited alongside, same era.
T. Tao and V. Vu, On random ± 1 \pm 1 matrices: Singularity and Determinant
2006
Cited alongside, same era.
T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices
2007
Cited alongside, same era.
M. Rudelson, Invertibility of random matrices: norm of the inverse
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, The Littlewood-Offord problem and invertibility of random matrices
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, Smallest singular value of a random rectangular matrix
2009
Cited alongside, same era.
R. O’Donnell, Analysis of Boolean functions
2014
Later among the works it cites.
K. Tikhomirov, The limit of the smallest singular value of random matrices with i.i.d. entries
2015
Later among the works it cites.
R. Adamczak, D. Chafai and P. Wolff, Circular law for random matrices with exchangeable entries
2016
Later among the works it cites.
K. Tikhomirov, The smallest singular value of random rectangular matrices with no moment assumptions on entries
2016
Later among the works it cites.
N. Cook, On the singularity of adjacency matrices for random regular digraphs
2017
Later among the works it cites.
A. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef, Adjacency matrices of random digraphs: singularity and anti-concentration
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
2009
Cited alongside, same era.
J. Bourgain, V. H. Vu and P. M. Wood, On the singularity probability of discrete random matrices
2010
Cited alongside, same era.
T. Tao and V. Vu, Random matrices: the distribution of the smallest singular values
2010
Cited alongside, same era.
H. H. Nguyen and V. H. Vu, Optimal Littlewood-Offord theorems
2011
Cited alongside, same era.
R. Vershynin, Spectral norm of products of random and deterministic matrices
2011
Cited alongside, same era.
C. Bordenave, P. Caputo and D. Chafai, Circular law theorem for random Markov matrices
2012
Cited alongside, same era.
2017
Later among the works it cites.
K. Söze, Real zeroes of random polynomials, II. Descartes’ rule of signs and anti-concentration on the symmetric group
2017
Later among the works it cites.
A. Basak, N. Cook and O. Zeitouni, Circular law for the sum of random permutation matrices
2018
Later among the works it cites.
E. Rebrova and K. Tikhomirov, Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries
2018
Later among the works it cites.
K. Tatarko, An upper bound on the smallest singular value of a square random matrix
2018
Later among the works it cites.
R. Vershynin, High dimensional probability. An introduction with applications in Data Science
2018
Later among the works it cites.
N. Cook, The circular law for random regular digraphs
2019
Later among the works it cites.
M. Kwan, B. Sudakov, and T. Tran, Anticoncentration for subgraph statistics
2019
Later among the works it cites.
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef, The smallest singular value of a shifted d d -regular random square matrix
2019
Later among the works it cites.
A. Mészáros, The distribution of sandpile groups of random regular graphs
2020
Closest in time.
K. Tikhomirov, Invertibility via distance for non-centered random matrices with continuous distributions
2020
Closest in time.
K. Tikhomirov, Singularity of Bernoulli matrices
2020
Closest in time.