Fetching the paper…
Reading the bibliography…
We present a new approach to showing that random graphs are nearly optimal expanders.
M. Takahasi, Note on chain conditions in free groups , Osaka Math. J 3
1951
Earlier work this paper cites.
Harry Kesten, Symmetric random walks on groups , Transactions of the American Mathematical Society (1959), 336–354
1959
Earlier work this paper cites.
Edward A Bender, The asymptotic number of non-negative integer matrices with given row and column sums , Discrete Mathematics 10
1974
Earlier work this paper cites.
R.I. Grigorchuk, Symmetric random walks on discrete groups , Uspekhi Matematicheskikh Nauk 32
1977
Earlier work this paper cites.
Frank Thomson Leighton, Finite common coverings of graphs , Journal of Combinatorial Theory, Series B 33
1982
Earlier work this paper cites.
John R. Stallings, Topology of finite graphs , Inventiones mathematicae 71
1983
Earlier work this paper cites.
N. Alon and V.D. Milman, λ \lambda 1, isoperimetric inequalities for graphs, and superconcentrators , Journal of Combinatorial Theory, Series B 38
1985
Earlier work this paper cites.
N. Alon, Eigenvalues and expanders , Combinatorica 6
1986
Earlier work this paper cites.
B. Bollobás and B.D. McKay, The number of matchings in random regular graphs and bipartite graphs , Journal of Combinatorial Theory, Series B 41
1986
Earlier work this paper cites.
A. Broder and E. Shamir, On the second eigenvalue of random regular graphs , Foundations of Computer Science, 1987., 28th Annual Symposium on, IEEE, 1987, pp. 286–294
1987
Earlier work this paper cites.
M. Burger, Chengs inequality for graphs , preprint, 1987
1987
Earlier work this paper cites.
A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs , Combinatorica 8
1988
Earlier work this paper cites.
G.A Margulis, Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators , Problemy Peredachi Informatsii 24
1988
Earlier work this paper cites.
J. Friedman, J. Kahn, and E. Szemeredi, On the second eigenvalue of random regular graphs , Proceedings of the twenty-first annual ACM symposium on Theory of computing, ACM, 1989, pp. 587–598
1989
Earlier work this paper cites.
J.P. Serre, Lettre à Winnie Li, 8 Octobre , 1990, see [GZ99]
1990
Earlier work this paper cites.
J. Friedman, On the second eigenvalue and random walks in random d-regular graphs , Combinatorica 11
1991
Earlier work this paper cites.
A. Nilli, On the second eigenvalue of a graph , Discrete Mathematics 91
1991
Earlier work this paper cites.
S. Northshield, Cogrowth of regular graphs , Proc. Amer. Math. Soc, vol. 116, 1992, pp. 203–205
1992
Earlier work this paper cites.
A. Sinclair, Algorithms for random generation and counting: a Markov chain approach , vol. 7, Birkhauser, 1993
1993
Earlier work this paper cites.
M. Morgenstern, Existence and explicit constructions of q+ 1 regular Ramanujan graphs for every prime power q , Journal of Combinatorial Theory, Series B 62
1994
Cited alongside, same era.
Y. Greenberg, On the spectrum of graphs and their universal coverings, (in Hebrew) , Ph.D. thesis, Hebrew University, 1995
1995
Cited alongside, same era.
F.R.K. Chung, Spectral Graph Theory , no. 92, American Mathematical Society, 1997
1997
Cited alongside, same era.
Michael S. O. Molloy, Hanna Robalewska, Robert W. Robinson, and Nicholas C. Wormald, 1-factorizations of random regular graphs , Random Structures and Algorithms 10
1997
Cited alongside, same era.
A. Lubotzky and T. Nagnibeda, Not every uniform tree covers Ramanujan graphs , Journal of Combinatorial Theory, Series B 74
1998
Cited alongside, same era.
2007
Later among the works it cites.
A. Miasnikov, E. Ventura, and P. Weil, Algebraic extensions in free groups , Geometric group theory (G.N. Arzhantseva, L. Bartholdi, J. Burillo, and E. Ventura, eds.), Trends Math., Birkhauser, 2007, pp. 225–253
2007
Later among the works it cites.
Oleg Bogopolski, Introduction to Group Theory , EMS Textbooks in Mathematics, European Mathematical Society, Zurich, 2008
2008
Later among the works it cites.
S.J. Miller, T. Novikoff, and A. Sabelli, The distribution of the largest nontrivial eigenvalues in families of random regular graphs , Experimental Mathematics 17
2008
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Bartholdi, Counting paths in graphs , Enseign. Math., II. Sér. 45
1999
Cited alongside, same era.
R.I. Grigorchuk and A. Zuk, On the asymptotic spectrum of random walks on infinite families of graphs , Random walks and discrete potential theory, Sympos. Math, vol. 39, Cambridge, 1999, pp. 188–204
1999
Cited alongside, same era.
1999
Cited alongside, same era.
A. Amit and N. Linial, Random graph coverings I: General theory and graph connectivity , Combinatorica 22
2002
Cited alongside, same era.
A. Amit, N. Linial, and J. Matoušek, Random lifts of graphs: independence and chromatic number , Random Structures & Algorithms 20
2002
Cited alongside, same era.
A.V. Borovik, A.G. Myasnikov, and V. Shpilrain, Measuring sets in infinite groups , Computational and Statistical Group Theory (Las Vegas, NV/Hoboken, NJ), Contemp. Math., American Mathematical Society, 2002, pp. 21–42
2002
Cited alongside, same era.
J. Burillo and E. Ventura, Counting primitive elements in free groups , Geometriae Dedicata 93
2002
Cited alongside, same era.
2010
Later among the works it cites.
Nati Linial and Doron Puder, Words maps and spectra of random graph lifts , Random Structures and Algorithms 37
2010
Later among the works it cites.
E. Lubetzky, B. Sudakov, and V. Vu, Spectra of lifted Ramanujan graphs , Advances in Mathematics 227
2011
Later among the works it cites.
A. Gundert and U. Wagner, On laplacians of random complexes , Proceedings of the 2012 symposuim on Computational Geometry, ACM, 2012, pp. 151–160
2012
Closest in time.
Y. Lyons, R. with Peres, Probability on trees and networks , Cambridge Univ Press, 2012, In preparation. Current version available at http://mypage.iu.edu/˜rdlyons/
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
I. Dumitriu, T. Johnson, S. Pal, and E. Paquette, Functional limit theorems for random regular graphs , Probability Theory and Related Fields 156
2013
Closest in time.
Adam Marcus, Daniel A Spielman, and Nikhil Srivastava, Interlacing families I: Bipartite Ramanujan graphs of all degrees , Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, IEEE, 2013, pp. 529–537
2013
Closest in time.
2014
Closest in time.
Alexander Lubotzky, Ramanujan complexes and high dimensional expanders , Japanese Journal of Mathematics 9
2014
Closest in time.
Doron Puder, Primitive words, free factors and measure preservation , Israel Journal of Mathematics 201
2014
Closest in time.
Doron Puder and Conan Wu, Growth of the primitives elements in free groups , Journal of London Mathematical Society 90
2014
Closest in time.
Doron Puder and Ori Parzanchevski, Measure preserving words are primitive , Journal of the American Mathematical Society 28
2015
Closest in time.