7 papers
Statistical Assessments of Representational Reforms: A Case Study from Los Angeles
Sarah Cannon, Evan T. R. Rosenman
Electoral reforms -- including changes to district boundaries, electoral rules, and the size of elected bodies -- are a recurrent feature of American state and municipal politics.…
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…
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…
Sampling Tree-Weighted Partitions Without Sampling Trees
Sarah Cannon, Topher Pankow, Wesley Pegden +1
This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on -partitions of a graph weig…
Pirogov--Sinai Theory Beyond Lattices
Sarah Cannon, Tyler Helmuth, Will Perkins
Pirogov--Sinai theory is a well-developed method for understanding the low-temperature phase diagram of statistical mechanics models on lattices. Motivated by physical and algorith…
Repetition effects in a Sequential Monte Carlo sampler
Sarah Cannon, Daryl DeFord, Moon Duchin
We investigate the prevalence of sample repetition in a Sequential Monte Carlo (SMC) method recently introduced for political redistricting.
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…