Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
Census Dual Graphs: Properties and Random Graph Models
Sara Anderson, Sarah Cannon, Brooke Feinberg +1
In the computational study of political redistricting, feasibility necessitates the use of a discretization of regions such as states, counties, and towns. In nearly all cases, res…
cs.DM2026
The Balanced Up-Down Walk
Hugo A. Akitaya, Sarah Cannon, Gregory Herschlag +3
Markov chains based on spanning trees have been hugely influential in algorithms for assessing fairness in political redistricting. The input graph represents the geographic buildi…
cs.DM2023
Sampling Balanced Forests of Grids in Polynomial Time
Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz
We prove that a polynomial fraction of the set of -component forests in the grid graph have equal numbers of vertices in each component, for any constant . This…