3 papers
cs.DS2026
Bonsai: A class of effective methods for independent sampling of graph partitions
Jeanne Clelland, Kristopher Tapp
We develop effective methods for constructing an ensemble of district plans via independent sampling from a reasonable probability distribution on the space of graph partitions. We…
math.CO2025
Balanced spanning trees of the 2-by-N grid
Makenzie Gallagher, Kristopher Tapp
We obtain an exact formula for the probability that a uniformly random spanning tree of the -by- square grid is ``balanced'' in the sense that it has an edge whose removal pa…
math.PR2025
On the Minimum Spanning Tree Distribution in Grids
Kristopher Tapp
We study the minimum spanning tree distribution on the space of spanning trees of the -by- grid for large . We establish bounds on the decay rates of the probability of th…