Sandpile Groups of Random Bipartite Graphs
From MaRDI portal
Publication:6286946
DOI10.1007/S00026-022-00616-0arXiv1705.07519MaRDI QIDQ6286946FDOQ6286946
Authors: Shaked Koplewitz 
Publication date: 21 May 2017
Abstract: 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 Melanie Wood and consider random graphs as a special case of random matrices, and rely on a variant the definition of min-entropy given by Maples, in order to obtain useful results about these random matrices. Our results show that unlike the sandpile groups of Erdos-Renyi 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.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
This page was built for publication: Sandpile Groups of Random Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286946)
