The distribution of sandpile groups of random regular graphs

Jessie MacWilliams. Orthogonal matrices over finite fields. The American Mathematical Monthly, 76(2):152-164, February 1969

1969

Earlier work this paper cites.

B. Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Combin., 1(4):311-316, 1980

1980

Earlier work this paper cites.

McKay, B. D. (1983) Spanning trees in regular graphs. Europ. J. Combin. 4 149-160

1983

Earlier work this paper cites.

H. Cohen and H. W. Lenstra, Jr. Heuristics on class groups of number fields. In Number theory, Noordwijkerhout 1983 (Noordwijkerhout, 1983), volume 1068 of Lecture Notes in Math., pages 33-62. Springer, Berlin, 1984

1984

Earlier work this paper cites.

E. Friedman and L. Washington, On the distribution of divisor class groups of curves over a finite field, Théorie des nombres (Quebec, PQ, 1987), de Gruyter, Berlin, 1989, pp. 227-239

1989

Earlier work this paper cites.

D. R. Heath-Brown. The size of selmer groups for the congruent number problem, ii. 118, 1994. preprint version, http://eprints.maths.ox.ac.uk/154/

1994

Earlier work this paper cites.

Svante Janson. Random Regular Graphs: Asymptotic Distributions and Contiguity. Combinatorics, Probability and Computing, 4(04):369-405, December 1995

1995

Earlier work this paper cites.

Rajendra Bhatia, Matrix analysis Graduate Texts in Mathematics, 169. Springer-Verlag, New York, 1997. xii+347 pp. ISBN: 0-387-94846-5

1997

Earlier work this paper cites.

M. S. O. Molloy, H. Robalewska, R. W. Robinson, and N. C. Wormald. 1 1 -factorizations of random regular graphs. Random Structures & Algorithms, 10(3):305-321, 1997

1997

Earlier work this paper cites.

Russel Lyons. Asymptotic Enumeration of Spanning Trees, Combin. Probab. Comput. 14 (2005), 491-522

2005

Cited alongside, same era.

Van Vu, Random discrete matrices. Horizons of combinatorics, 257-280, Bolyai Soc. Math. Stud., 17, Springer, Berlin, 2008

2008

Cited alongside, same era.

Jordan Ellenberg, Akshay Venkatesh, and Craig Westerland. Homological stability for Hurwitz spaces and the Cohen-Lenstra conjecture over function fields. arXiv:0912.0325, 2009

Original

2009

Cited alongside, same era.

Lionel Levine and James Propp. What is … a sandpile? Notices Amer. Math. Soc., 57(8):976-979, 2010

2010

Cited alongside, same era.

Serguei Norine and Peter Whalen. Jacobians of nearly complete and threshold graphs. European Journal of Combinatorics, 32(8):1368-1376, November 2011

2011

Cited alongside, same era.

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.

Miklós Abért, ’Graph convergence, Luck approximation mod p and the entropy of cellular automata’, Growth, symbolic dynamics and combinatorics of words in groups, June 2, 2015, ENS, Paris, video available at https://www.youtube.com/watch?v=wRRFOGPnaJY

2015

Later among the works it cites.

Rémi Bardenet, Odalric-Ambrym Maillard, Concentration inequalities for sampling without replacement, Bernoulli 21 (2015), no. 3, 13611385

2015

Later among the works it cites.

Matthew Farrell and Lionel Levine. CoEulerian graphs. Proceedings of the American Mathematical Society, 2015

2015

Later among the works it cites.

Shaked Koplewitz. Sandpile groups and the coEulerian property for random directed graphs, Advances in Applied Mathematics, 2017