Sandpile Groups of Random Bipartite Graphs.

We determine the asymptotic distribution of the p-rank of the sandpile groups of random bipartite graphs. We see that this depends on the ratio between the number of vertices on each side, with a threshold when the ratio between the sides is equal to 1 p . We follow the approach of Wood (J Am Math Soc 30(4):915–958, 2017) and consider random graphs as a special case of random matrices, and rely on a variant the definition of min-entropy given by Maples (Cokernels of random matrices satisfy the Cohen–Lenstra heuristics, 2013) to obtain useful results about these random matrices. Our results show that unlike the sandpile groups of Erdős–Rényi random graphs, the distribution of the sandpile groups of random bipartite graphs depends on the properties of the graph, rather than coming from some more general random group model. [ABSTRACT FROM AUTHOR]