Distribution of Sandpile groups of random directed bipartite graphs
Abstract
Fix a prime p and a constant 1p<α≤ 1. Consider the random directed Erdős--Rényi bipartite graph G(n,αn ,v) with bipartition (V1,V2) of sizes |V1|=n and |V2|=αn, and edge probability 0<v<1. Bhargava, DePascale and Koenig conjectured a limiting distribution for the p-Sylow subgroup of the sandpile group of G(n,αn,v) as n∞. We prove this conjecture. Similar results have previously been proved by computing the expected number of surjections from the random abelian p-group onto H, for each finite abelian p-group H. However, in the case of p-Sylow subgroups of sandpile groups of random directed bipartite graphs, these surjective moments often diverge to infinity, despite the conjectured limiting distribution having finite moments. We resolve this by restricting to a high-probability subset of graphs on which the surjective moments are well-behaved, and discarding a rare exceptional set of graphs whose contribution to the distribution vanishes but whose contribution to the surjective moments often diverges. Computing the conditional surjective moments on the good set and applying Wood's universality theorem yields the desired convergence in distribution.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.