Fetching the paper…
Reading the bibliography…
We consider three different models of sparse random graphs:~undirected and directed Erd\H{o}s-R\'{e}nyi graphs, and random bipartite graph with an equal number of left and right vertices.
Numerical inverting of matrices of high order
J. von Neumann and H. H. Goldstine · 1947
Earlier work this paper cites.
Collected works. Vol. V: Design of computers, theory of automata and numerical analysis
J. von Neumann · 1963
Earlier work this paper cites.
On the determinant of ( 0 , 1 ) (0,1) matrices
J. Komlós · 1967
Earlier work this paper cites.
On the determinant of random matrices
J. Komlós · 1968
Earlier work this paper cites.
Circulated manuscript. Edited version available online at http://sites.math.rutgers.edu/~komlos/01short.pdf , 1977
J. Komlós · 1977
Earlier work this paper cites.
On the efficiency of algorithms of analysis
S. Smale · 1985
Earlier work this paper cites.
Eigenvalues and condition numbers of random matrices
A. Edelman · 1988
Earlier work this paper cites.
On subspaces spanned by random selections of ± 1 \pm 1 vectors
A. M. Odlyzko · 1988
Earlier work this paper cites.
On the probability that a random ± 1 \pm 1 matrix is singular
J. Kahn, J. Komlós, and E. Szemerédi · 1995
Earlier work this paper cites.
Some estimates of norms of random matrices
R. Latała · 2004
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.
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
A. Sankar, D. A. Spielman, and S.-H. Teng · 2006
Earlier work this paper cites.
On random ± 1 \pm 1 matrices: singularity and determinant
T. Tao and V. Vu · 2006
Earlier work this paper cites.
On the singularity probability of random Bernoulli matrices
T. Tao and V. Vu · 2007
Earlier work this paper cites.
The rank of random graphs
K. P. Costello and V. H. Vu · 2008
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
Earlier work this paper cites.
Random matrices: the circular law
T. Tao and V Vu · 2008
Earlier work this paper cites.
Random discrete matrices
V. Vu · 2008
Earlier work this paper cites.
Smallest singular value of a random rectangular matrix
M. Rudelson and R. Vershynin · 2009
Earlier work this paper cites.
Spectral analysis of large dimensional random matrices
Z. D. Bai, and J. W. Silverstein · 2010
Earlier work this paper cites.
On the singularity probability of discrete random matrices
J. Bourgain, V. Vu, and P. M. Wood · 2010
Cited alongside, same era.
On the rank of random sparse matrices
K. P. Costello and V. Vu · 2010
Cited alongside, same era.
The circular law for random matrices
F. Götze and A. Tikhomirov · 2010
Cited alongside, same era.
Random matrices: universality of the ESDs and the circular law
T. Tao and V. Vu · 2010
Cited alongside, same era.
Circular Law Theorem for Random Markov Matrices
C. Bordenave, P. Caputo, and D. Chafaï · 2012
Cited alongside, same era.
Around the circular law
C. Bordenave and D. Chafaï · 2012
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices
Least singular value, circular law, and Lindeberg exchange
T. Tao · 2017
Later among the works it cites.
Investigate invertibility of sparse symmetric matrices
F. Wei · 2017
Later among the works it cites.
Circular law for the sum of random permutations
A. Basak, N. Cook, and O. Zeitouni · 2018
Closest in time.
Invertibility of adjacency matrices for random d d -regular directed graphs
J. Huang · 2018
Closest in time.
Invertibility of adjacency matrices for random d d -regular graphs
J. Huang · 2018
Closest in time.
The rank of random regular digraphs of constant degree
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Vershynin · 2012
Cited alongside, same era.
Universality and the circular law for sparse random matrices
P. M. Wood · 2012
Cited alongside, same era.
Limiting spectral distribution of sum of unitary and orthogonal matrices
A. Basak and A. Dembo · 2013
Cited alongside, same era.
Concentration inequalities: A nonasymptotic theory of independence
S. Boucheron, G. Lugosi, and P. Massart · 2013
Cited alongside, same era.
Bilinear and quadratic variants on the Littlewood-Offord problem
K. P. Costello · 2013
Cited alongside, same era.
Hitting Time Theorems for Random Matrices
L. Addario-Berry and L. Eslava · 2014
Cited alongside, same era.
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2018
Closest in time.
Cokernels of adjacency matrices of random r r -regular graphs
H. H. Nguyen and W. M. Wood · 2018
Closest in time.
Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries
E. Rebrova and K. Tikhomirov · 2018
Closest in time.
The circular law for sparse non-Hermitian matrices
A. Basak and M. Rudelson · 2019
Closest in time.
The circular law for random regular digraphs
N. Cook · 2019
Closest in time.
Fixed energy universality of Dyson Brownian motion
B. Landon, P. Sosoe, and H.-T. Yau · 2019
Closest in time.
The smallest singular value of a shifted d d -regular random square matrix
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2019
Closest in time.
The sparse circular law under minimal assumptions
M. Rudelson and K. Tikhomirov · 2019
Closest in time.
H. Huang · 2020
Closest in time.
Singularity of discrete random matrices I
V. Jain, A. Sah, and M. Sawhney · 2020
Closest in time.
Singularity of discrete random matrices II
V. Jain, A. Sah, and M. Sawhney · 2020
Closest in time.
Singularity of sparse Bernoulli matrices
A. E. Litvak and K. E. Tikhomirov · 2020
Closest in time.
The distribution of sandpile groups of random regular graphs
A. Mészáros · 2020
Closest in time.
Singularity of random Bernoulli matrices
K. Tikhomirov · 2020
Closest in time.
Circular law for sparse random regular digraphs
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2021
Closest in time.