redist
CRANredistMaRDI QIDQ58523FDOQ58523
Simulation Methods for Legislative Redistricting
Christopher T. Kenny, Cory McCartan, Kosuke Imai, Ben Fifield
Last update: 13 January 2024
Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0
Software version identifier: 4.1.1, 1.0, 1.1, 1.2, 1.3-1, 1.3-2, 1.3-3, 1.3, 2.0.1, 2.0.2, 3.0.1, 3.0.7, 3.1.1, 3.1.3, 3.1.4, 3.1.5, 4.0.1, 4.1.0, 4.2.0
Enables researchers to sample redistricting plans from a pre-specified target distribution using Sequential Monte Carlo and Markov Chain Monte Carlo algorithms. The package allows for the implementation of various constraints in the redistricting process such as geographic compactness and population parity requirements. Tools for analysis such as computation of various summary statistics and plotting functionality are also included. The package implements the SMC algorithm of McCartan and Imai (2023) <doi:10.1214/23-AOAS1763>, the enumeration algorithm of Fifield, Imai, Kawahara, and Kenny (2020) <doi:10.1080/2330443X.2020.1791773>, the Flip MCMC algorithm of Fifield, Higgins, Imai and Tarr (2020) <doi:10.1080/10618600.2020.1739532>, the Merge-split/Recombination algorithms of Carter et al. (2019) <arXiv:1911.01503> and DeFord et al. (2021) <doi:10.1162/99608f92.eb30390f>, and the Short-burst optimization algorithm of Cannon et al. (2020) <arXiv:2011.02288>.
- The Essential Role of Empirical Validation in Legislative Redistricting Simulation
- Automated Redistricting Simulation Using Markov Chain Monte Carlo
- Recombination: A Family of Markov Chains for Redistricting
- Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
- Voting Rights, Markov Chains, and Optimization by Short Bursts
- Sequential Monte Carlo for sampling balanced and compact redistricting plans
This page was built for software: redist
