  Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random
partitions. We connect these random partitions to the Hall-Littlewood
polynomials of symmetric function theory, and use this connection to give
combinatorial proofs of properties of these random partitions. In addition, we
use Markov chains to give an algorithm for generating these partitions.
