Fetching the paper…
Reading the bibliography…
Let $d$ and $n$ be integers satisfying $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in \mathbb{C}$.
H. Kesten, Symmetric random walks on groups, Trans. Amer. Math. Soc. 92
1959
Earlier work this paper cites.
R. Bauerschmidt, A. Knowles and H.-T. Yau, Local semicircle law for random regular graphs, Comm. Pure Appl. Math. 70
1960
Earlier work this paper cites.
W. Hoeffding, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58
1963
Earlier work this paper cites.
C. G. Esseen, On the Kolmogorov-Rogozin inequality for the concentration function, Z. Wahrsch. Verw. Gebiete 5
1966
Earlier work this paper cites.
C. G. Esseen, On the concentration function of a sum of independent random variables, Z. Wahrsch. Verw. Gebiete 9
1968
Earlier work this paper cites.
H. Kesten, A sharper form of the Doeblin-Lévy-Kolmogorov-Rogozin inequality for concentration functions, Math. Scand. 25
1969
Earlier work this paper cites.
G. Halász, On the distribution of additive arithmetic functons, Acta Arithmetica, XXVII
1975
Earlier work this paper cites.
G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Per. Math. Hung. 8
1977
Earlier work this paper cites.
B. D. McKay, The expected eigenvalue distribution of a large regular graph, Linear Algebra Appl. 40
1981
Earlier work this paper cites.
B. D. McKay, Asymptotics for 0 0 - 1 1 matrices with prescribed line sums, in Enumeration and design (Waterloo, Ont., 1982)
1982
Earlier work this paper cites.
J. Dodziuk, Difference equations, isoperimetric inequality and transience of certain random walks, Trans. Amer. Math. Soc. 284
1984
Earlier work this paper cites.
V. L. Girko, The circular law, Teor. Veroyatnost. i Primenen. 29
1984
Earlier work this paper cites.
N. Alon and V. D. Milman, λ 1 , \lambda_{1}, isoperimetric inequalities for graphs, and superconcentrators, J. Combin. Theory Ser. B 38
1985
Earlier work this paper cites.
J. Friedman, J. Kahn and E. Szemerédi, On the second eigenvalue of random regular graphs, Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989), 587–598
1989
Earlier work this paper cites.
A. L. Miroshnikov, Theory Probab. Appl. 34
1989
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, J. Amer. Math. Soc. 8
1995
Earlier work this paper cites.
A. Z. Broder, A. M. Frieze, S. Suen and E. Upfal, Optimal construction of edge-disjoint paths in random graphs, SIAM J. Comput. 28
1999
Cited alongside, same era.
A. E. Litvak, A. Pajor, M. Rudelson and N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv. Math. 195
2005
Cited alongside, same era.
C. Greenhill, B. D. McKay and X. Wang, Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums, J. Combin. Theory Ser. A 113
2006
Cited alongside, same era.
S. Hoory, N. Linial and A. Wigderson, Expander graphs and their applications, Bull. Amer. Math. Soc. (N.S.) 43
2006
Cited alongside, same era.
T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc. 20
2007
Cited alongside, same era.
I. Dumitriu, T. Johnson, S. Pal, E. Paquette, Functional limit theorems for random regular graphs, Probab. Theory Related Fields 156 (2013), no. 3-4, 921–975. MR3078290
2013
Later among the works it cites.
L. V. Tran, V. H. Vu and K. Wang, Sparse random graphs: eigenvalues and eigenvectors, Random Structures Algorithms 42
2013
Later among the works it cites.
N. Anantharaman and E. Le Masson, Quantum ergodicity on large regular graphs, Duke Math. J. 164
2015
Later among the works it cites.
L. Geisinger, Convergence of the density of states and delocalization of eigenvectors on random regular graphs. J. Spectr. Theory 5
2015
Later among the works it cites.
D. Puder, Expansion of random graphs: new proofs, new results, Invent. Math. 201
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Friedman, A proof of Alon’s second eigenvalue conjecture and related problems, Mem. Amer. Math. Soc. 195
2008
Cited alongside, same era.
M. Rudelson, Invertibility of random matrices: norm of the inverse, Ann. of Math. 168
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, The Littlewood-Offord problem and invertibility of random matrices, Adv. Math. 218
2008
Cited alongside, same era.
T. Tao and V. Vu, Random matrices: the circular law, Commun. Contemp. Math. 10
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, Smallest singular value of a random rectangular matrix, Comm. Pure Appl. Math. 62
2009
Cited alongside, same era.
T. Tao and V. H. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Ann. of Math. 169
2009
Cited alongside, same era.
Z. Bai and J. W. Silverstein, Spectral analysis of large dimensional random matrices
2010
Cited alongside, same era.
M. Rudelson and R. Vershynin, Delocalization of eigenvectors of random matrices with independent entries, Duke Math. J. 164
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, C. R. Math. Acad. Sci. Paris 354
2016
Later among the works it cites.
M. Rudelson and R. Vershynin, No-gaps delocalization for general random matrices, Geom. Funct. Anal. 26
2016
Later among the works it cites.
A. Basak and M. Rudelson, Invertibility of sparse non-Hermitian matrices, Adv. Math. 310
2017
Later among the works it cites.
P. Bourgade, J. Huang and H.-T. Yau, Eigenvector statistics of sparse random matrices, Electron. J. Probab. 22
2017
Later among the works it cites.
N. A. Cook, Discrepancy properties for random regular digraphs, Random Structures Algorithms 50
2017
Later among the works it cites.
N. A. Cook, On the singularity of adjacency matrices for random regular digraphs, Probab. Theory Related Fields 167
2017
Later among the works it cites.
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann and P. Youssef, Adjacency matrices of random digraphs: singularity and anti-concentration, J. Math. Anal. Appl. 445
2017
Later among the works it cites.
A. Basak, N. Cook and O. Zeitouni, Circular law for the sum of random permutation matrices, Electronic Journal of Probability, 23
2018
Closest in time.
N. Cook, L. Goldstein and T. Johnson, Size biased couplings and the spectral gap for random regular graphs, Ann. Probab. 46
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, J. of Complexity, 48
2018
Closest in time.