Distribution of Sandpile groups of random bipartite graphs

Fix a prime $p$ and a constant $\frac{1}{p}<\alpha \le 1$. Consider the random Erdős–Rényi bipartite graph $G_{\alpha }(n,u)$ with bipartition $(V_1,V_2)$ of sizes $\mathrm{\mid }{V}_1\mathrm{\mid }=n$ and $\mathrm{\mid }{V}_2\mathrm{\mid }=\lceil \alpha n\rceil$, and edge probability $0<u<1$. The authors of [1] and [8] conjectured a limiting distribution for the $p$-Sylow subgroup of the sandpile group of $G_{\alpha }(n,u)$ as $n\to \mathrm{\infty }$. We prove this conjecture for odd primes $p$. Similar results have previously been proved by computing the expected number of surjections from the random abelian $p$-group to $H$, for each finite abelian $p$-group $H$. However, in our setting, these surjective moments often diverge to infinity, despite the conjectured limiting distribution having finite moments. We resolve this issue by discarding the graphs for which too many vertices have degrees divisible by $p$. Once we remove the contribution of this rare set of graphs, then the surjective moments converge to the expected values. When $p$ is odd, applying Wood’s universality theorem yields the desired convergence in distribution. For $p=2$, our computed moments (after excluding the rare set of graphs) match those of the conjectured distribution. However, these moments do not uniquely determine a distribution.