Combinatorics Seminar

The sandpile group of a graph can be defined as the cokernel of its reduced Laplacian. Families of graphs then give rise to families of matrices and we would like to understand the distribution of their cokernels. We will discuss results about cokernels of random matrices and sandpile groups of random graphs, and describe connections to the Cohen-Lenstra heuristics from number theory.