Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
复制标题
用于平衡和紧凑重划区计划抽样的顺序蒙特卡罗
DOI:
10.1214/23-aoas1763
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
K. Imai
中科院分区:
文献类型:
--
作者:
Cory McCartan;K. Imai
Random sampling of graph partitions under constraints has become a popular tool for evaluating legislative redistricting plans. Analysts detect partisan gerrymandering by comparing a proposed redistricting plan with an ensemble of sampled alternative plans. For successful application, sampling methods must scale to large maps with many districts, incorporate realistic legal constraints, and accurately sample from a selected target distribution. Unfortunately, most existing methods struggle in at least one of these three areas. We present a new Sequential Monte Carlo (SMC) algorithm that draws representative redistricting plans from a realistic target distribution of choice. Because it yields nearly independent samples, the SMC algorithm can efficiently explore the relevant space of redistricting plans than the existing Markov chain Monte Carlo algorithms that yield dependent samples. Our algorithm can simultaneously incorporate several constraints commonly imposed in real-world redistricting problems, including equal population, compactness, and preservation of administrative boundaries. We validate the accuracy of the proposed algorithm by using a small map where all redistricting plans can be enumerated. We then apply the SMC algorithm to evaluate the partisan implications of several maps submitted by relevant parties in a recent high-profile redistricting case in the state of Pennsylvania. Open-source software is available for implementing the proposed methodology.
DOI:
10.1073/pnas.1617540114
发表时间:
2017-03-14
影响因子:
11.1
作者:
Chikina, Maria;Frieze, Alan;Pegden, Wesley
通讯作者:
Pegden, Wesley