Gerrymandering策略的格研究
Lattice Studies of Gerrymandering Strategies
摘要:
我们提出了三个新的选区划分算法,将选民的空间分布,目的是构建选区划分,人口相等,连接区。此外,我们开发晶格模型的选民分布,基于类比静电势,为了比较不同的选区划分策略。由于我们的选民模型固有的概率人口波动,蒙特卡罗方法可以应用于通过我们的选区划分算法构建的地区。通过蒙特卡洛研究,我们量化了我们的每个选区划分算法的有效性,我们还认为,选区划分策略,不包括空间数据导致(法律禁止)高度断开的地区。在我们提出的三种算法中,有两种是基于包装反对派选民的不同策略,第三种是基于遗传算法的算法选区划分的新方法,它自动保证所有地区都是连接的。此外,我们使用我们的格选民模型来研究等周商测试的有效性,我们的研究结果提供了进一步的定量支持,在现实世界中的政治选区划分实施紧凑性测试。
英文摘要:
We propose three novel gerrymandering algorithms which incorporate the spatial distribution of voters with the aim of constructing gerrymandered, equal-population, connected districts. Moreover, we develop lattice models of voter distributions, based on analogies to electrostatic potentials, in order to compare different gerrymandering strategies. Due to the probabilistic population fluctuations inherent to our voter models, Monte Carlo methods can be applied to the districts constructed via our gerrymandering algorithms. Through Monte Carlo studies we quantify the effectiveness of each of our gerrymandering algorithms and we also argue that gerrymandering strategies which do not include spatial data lead to (legally prohibited) highly disconnected districts. Of the three algorithms we propose, two are based on different strategies for packing opposition voters, and the third is a new approach to algorithmic gerrymandering based on genetic algorithms, which automatically guarantees that all districts are connected. Furthermore, we use our lattice voter model to examine the effectiveness of isoperimetric quotient tests and our results provide further quantitative support for implementing compactness tests in real-world political redistricting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。