The distribution of sandpile groups of random graphs
arXiv:1402.5149
Abstract
We determine the distribution of the sandpile group (a.k.a. Jacobian) of the Erdős-Rényi random graph G(n,q) as n goes to infinity. Since any particular group appears with asymptotic probability 0 (as we show), it is natural ask for the asymptotic distribution of Sylow p-subgroups of sandpile groups. We prove the distributions of Sylow p-subgroups converge to specific distributions conjectured by Clancy, Leake, and Payne. These distributions are related to, but different from, the Cohen-Lenstra distribution. Our proof involves first finding the expected number of surjections from the sandpile group to any finite abelian group (the "moments" of a random variable valued in finite abelian groups). To achieve this, we show a universality result for the moments of cokernels of random symmetric integral matrices that is strong enough to handle dependence in the diagonal entries. We then show these moments determine a unique distribution despite their p^{k^2}-size growth.
References in corpus (8)
- On the Sandpile group of the cone of a graph
- Homological stability for Hurwitz spaces and the Cohen-Lenstra conjecture over function fields, II
- The critical group of a directed graph
- Singularity of Random Matrices over Finite Fields
- Invertibility of symmetric random matrices
- Cokernels of random matrices satisfy the Cohen-Lenstra heuristics
- On a Cohen-Lenstra Heuristic for Jacobians of Random Graphs
- A note on Jacobians, Tutte polynomials, and two-variable zeta functions of graphs