Fetching the paper…
Reading the bibliography…
Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices.
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.
The asymptotic number of labeled graphs with given degree sequences
E. A. Bender and E. R. Canfield · 1978
Earlier work this paper cites.
Enumeration of labelled graphs. I. 3 3 -connected graphs
N. Wormald · 1979
Earlier work this paper cites.
Enumeration of labelled graphs. II. Cubic graphs with a given connectivity
N. C. Wormald · 1979
Earlier work this paper cites.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
B. Bollobás · 1980
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.
Random symmetric matrices are almost surely nonsingular
K. P. Costello, 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.
The Littlewood-Offord problem and invertibility of random matrices
M. Rudelson and R. Vershynin · 2008
Earlier work this paper cites.
Random discrete matrices
V. Vu · 2008
Cited alongside, same era.
Smallest singular value of a random rectangular matrix
M. Rudelson and R. Vershynin · 2009
Cited alongside, same era.
On the singularity probability of discrete random matrices
J. Bourgain, V. H. Vu, and P. M. Wood · 2010
Cited alongside, same era.
Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
H. H. Nguyen · 2012
Cited alongside, same era.
Random structures and algorithms
A. Frieze · 2014
Cited alongside, same era.
Invertibility of symmetric random matrices
R. Vershynin · 2014
Cited alongside, same era.
Combinatorial problems in random matrix theory
The circular law for random regular digraphs
N. A. Cook · 2017
Later among the works it cites.
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
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2017
Later among the works it cites.
Circular law for the sum of random permutation matrices
A. Basak, N. Cook, and O. Zeitouni · 2018
Closest in time.
Some problems on random discrete matrices
A. Ferber, K. Luh, G. McKinley, and W. Samotij · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. H. Vu · 2014
Cited alongside, same era.
Fixed energy universality of Dyson Brownian motion
B. Landon, P. Sosoe, and H.-T. Yau · 2016
Cited alongside, same era.
The circular law for sparse non-hermitian matrices
A. Basak and M. Rudelson · 2017
Cited alongside, same era.
Invertibility of sparse non-Hermitian matrices
A. Basak and M. Rudelson · 2017
Cited alongside, same era.
Closest in time.
The rank of random regular digraphs of constant degree
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2018
Closest in time.
Structure of eigenvectors of random regular digraphs
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef · 2018
Closest in time.
The distribution of sandpile groups of random regular graphs
A. Mészáros · 2018
Closest in time.
Cokernels of adjacency matrices of random r-regular graphs
H. H. Nguyen and W. M. Matchett · 2018
Closest in time.