Fetching the paper…
Reading the bibliography…
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.
1904
Earlier work this paper cites.
1906
Earlier work this paper cites.
1910
Earlier work this paper cites.
J. E. Littlewood and A. C. Offord, On the number of real roots of a random algebraic equation. III. Rec. Math. [Mat. Sbornik] N.S
1943
Earlier work this paper cites.
P. Erdös, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc
1945
Earlier work this paper cites.
A. Sárközy and E. Szemerédi, Uber ein Problem von Erdös und Moser, Acta Arithmetica
1965
Earlier work this paper cites.
J. Komlós, On the determinant of ( 0 , 1 ) (0,1) matrices, Studia Sci. Math. Hungar
1967
Earlier work this paper cites.
J. Komlós, On the determinant of random matrices, Studia Sci. Math. Hungar
1968
Earlier work this paper cites.
G. Halász, Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar
1977
Earlier work this paper cites.
V. L. Girko, A central limit theorem for random determinants. Teor. Veroyatnost. i Mat. Statist
1979
Earlier work this paper cites.
L. Babai, D. Grigoryev, and D. Mount, Isomorphism of graphs with bounded eigenvalue multiplicity, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 310–324 (1982)
1982
Earlier work this paper cites.
N. Alon, Eigenvalues and expanders, Combinatorica
1986
Earlier work this paper cites.
J. Friedman. On the second eigenvalue and random walks in random d-regular graphs. Technical Report
1988
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs, Combinatorica
1988
Earlier work this paper cites.
G.A. Margulis , Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators [in Russian] . Problemy Peredachi Informatsii
1988
Earlier work this paper cites.
F. Chung, R. Graham, and R. Wilson, Quasi-random graphs. Combinatorica
1989
Earlier work this paper cites.
J. Kahn and E. Szemerédi, STOC 1989
1989
Earlier work this paper cites.
A. Edelman, E. Kostlan, and M. Shub, How many eigenvalues of a random matrix are real? J. Amer. Math. Soc
1994
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
1995
Earlier work this paper cites.
F. Chung, Spectral graph theory, CBMS series
1997
Earlier work this paper cites.
V. L. Girko, A refinement of the central limit theorem for random determinants. (Russian) Teor. Veroyatnost. i Primenen
1998
Earlier work this paper cites.
N.C. Wormald, Models of random regular graphs, In Surveys in Combinatorics,
1999
Earlier work this paper cites.
B. Bollobás, Random graphs. Second edition, Cambridge Studies in Advanced Mathematics
2001
Earlier work this paper cites.
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
2004
Earlier work this paper cites.
K. Costello, T. Tao, and V. Vu, Random symmetric matrices are almost surely singular, Duke Math. J
2006
Cited alongside, same era.
M. Krivelevich and B. Sudakov, Pseudo-random graphs. More sets, graphs and numbers
2006
Cited alongside, same era.
T. Tao and V. Vu, On random ± 1 \pm 1 matrices: Singularity Determinant, Random Structures Algorithms
2006
Cited alongside, same era.
T. Tao and V. Vu, Additive Combinatorics, Cambridge Univ. Press
2006
Cited alongside, same era.
T. Tao and V. Vu, On the singularity probability of random Bernoulli matrices, J. Amer. Math. Soc
2007
Cited alongside, same era.
N. Alon and J. Spencer, The probabilistic method, 3rd ed., John Wiley & Sons Inc
2008
L. Addario-Berry and L. Eslava, Hitting time theorems for random matrices, Combinatorics, Probability and Computing
2014
Later among the works it cites.
A. Frieze, Random structures and algorithms. In Proceedings of the International Congress of Mathematicians, Seoul 2014. Vol. 1, pages 311–340. Kyung Moon Sa, Seoul, 2014
2014
Later among the works it cites.
H. Nguyen and V. Vu, Random matrices: Law of the determinant, Annals of Probability
2014
Later among the works it cites.
R. Vershynin, Invertibility of symmetric random matrices, Random Structures and Algorithms
2014
Later among the works it cites.
V. Vu, Combinatorial problems in random matrix theory. In Proceedings of the International Congress of Mathematicians, Seoul 2014. Vol. IV, pages 489–508. Kyung Moon Sa, Seoul, 2014
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
K. Costello and V. Vu, The ranks of random graphs. Random Structures and Algorithm
2008
Cited alongside, same era.
J. Fiedman, A proof of Alon’s second eigenvalue conjecture and related problems, Mem. Amer. Math. Soc
2008
Cited alongside, same era.
M. Rudelson and R. Vershynin, The Littlewood-Offord problem and invertibility of random matrices, Adv. Math
2008
Cited alongside, same era.
B. Sudakov and V. Vu, Local resilience of graphs, Random Structures Algorithms
2008
Cited alongside, same era.
V. Vu. Random discrete matrices. In Horizons of combinatorics, volume 17 of Bolyai Soc. Math. Stud., pages 257–280. Springer, Berlin, 2008
2008
Cited alongside, same era.
O. Ahmadi, N. Alon, I. Blake, and I. Shparlinski, Graphs with integral spectrum, Linear Algebra and its Applications
2009
Cited alongside, same era.
J. Clancy, T. Leake, N. Kaplan, S. Payne, and Melanie Matchett Wood, On a Cohen-Lenstra heuristic for Jacobians of random graphs, J. Algebraic Combin
2015
Later among the works it cites.
A. Marcus, D. Spielman, and N. Srivastava, Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees, Ann. of Math
2015
Later among the works it cites.
D. Puder, Expansion of Random Graphs: New Proofs, New Results, Inventiones Mathematicae
2015
Later among the works it cites.
T. Tao and V. Vu, Random matrices: Universality of local spectral statistics of non-Hermitian matrices, Annals of Probability
2015
Later among the works it cites.
K. Costello and P. Williams, On the Number of Integral Graphs, Linear Algebra and its Applications
2016
Later among the works it cites.
B. Landon, P. Sosoe, and H.-T. Yau. Fixed energy universality of Dyson Brownian motion, arXiv: 1609.09011, 2016
2016
Later among the works it cites.
N. Cook. On the singularity of adjacency matrices for random regular digraphs, Probab. Theory Related Fields,
2017
Later among the works it cites.
S. Ge, PhD Thesis, UCLA 2017, https://escholarship.org/content/qt1n54260
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
2017
Later among the works it cites.
H. Nguyen, T. Tao, and V. Vu, Random matrices: tail bounds for gaps between eigenvalues, Probability Theory and Related Fields,
2017
Later among the works it cites.
T. Tao and V. Vu, Random matrices have simple spectrum, Combinatorica
2017
Later among the works it cites.
M. M. Wood, The distribution of sandpile groups of random graphÆs, Journal of the A. M. S,
2017
Later among the works it cites.
J. Huang, Invertibility of adjacency matrices for random d-regular graphs, (2018). arXiv: 1807.06465
2018
Later among the works it cites.
J. Huang, Invertibility of adjacency matrices for random d-regular directed graphs, (2018). arXiv: 1806.01382
2018
Later among the works it cites.
A. E. Litvak, A. Lytova, K. Tikhomirov, N. Tomczak-Jaegermann, and P. Youssef. The rank of random regular digraphs of constant degree, Journal of Complexity
2018
Later among the works it cites.
A. Mészáros. The distribution of sandpile groups of random regular graphs, arXiv: 1806.03736, 2018
2018
Later among the works it cites.
P. Bourgade and K. Mudy, Gaussian fluctuations of the determinant of Wigner Matrices, Electronic Journal of Probability,
2019
Later among the works it cites.
A. Deneanu and V. Vu, Random matrices: Probability of Normality, Advances of M
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, Prob. Th. Rel. Fields,
2019
Later among the works it cites.
K. Tikhomirov, Singularity of random Bernoulli matrices Annals of Mathematics
2020
Closest in time.