Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
From MaRDI portal
Publication:58510
DOI10.48550/arXiv.2008.06131arXiv2008.06131MaRDI QIDQ58510
Cory McCartan, Kosuke Imai, Cory W. McCartan, Kosuke Imai
Publication date: 13 August 2020
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.06131
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On sequential Monte Carlo, partial rejection control and approximate Bayesian computation
- The sample size required in importance sampling
- Inference from iterative simulation using multiple sequences
- Numerically stable online estimation of variance in particle filters
- A tabu search heuristic and adaptive memory procedure for political districting
- Rank-normalization, folding, and localization: an improved \(\widehat{R}\) for assessing convergence of MCMC (with Discussion)
- Sequential Monte Carlo Methods in Practice
- An Optimization Based Heuristic for Political Districting
- Sequential Monte Carlo Samplers
- Rejection Control and Sequential Importance Sampling
- Variance estimation in the particle filter
- Assessing significance in a Markov chain without mixing
- The number of spanning trees in graphs with a given degree sequence
- Three applications of entropy to gerrymandering
- Automated Redistricting Simulation Using Markov Chain Monte Carlo
- Elements of Information Theory
- Reconfiguration of connected graph partitions via recombination
This page was built for publication: Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
