A Comparison of Precinct and District Voting Data Using Persistent Homology to Identify Gerrymandering in North Carolina

• URL: http://arxiv.org/abs/2506.13997v4
• Date: Thu, 30 Oct 2025 01:41:26 GMT
• Title: A Comparison of Precinct and District Voting Data Using Persistent Homology to Identify Gerrymandering in North Carolina
• Authors: Ananya Shah,
• Abstract summary: We use the level-set method to compare precinct level voting data to district level voting data.<n>We show that precinct level voting patterns do not significantly fluctuate biannually, while district level patterns do.<n>This research presents a novel application of topological data analysis in evaluating gerrymandering and shows persistent homology can be useful in discerning gerrymandered districts.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gerrymandering is one of the biggest threats to American democracy. By manipulating district lines, politicians effectively choose their voters rather than the other way around. Current gerrymandering identification methods (namely the Polsby-Popper and Reock scores) focus on the compactness of congressional districts, making them extremely sensitive to physical geography. To address this gap, we extend Feng and Porter's 2021 paper, which used the level-set method to turn geographic shapefiles into filtered simplicial complexes, in order to compare precinct level voting data to district level voting data. As precincts are regarded as too small to be gerrymandered, we are able to identify discrepancies between precinct and district level voting data to quantify gerrymandering in the United States. By comparing the persistent homologies of Democratic voting regions at the precinct and district levels, we detect when areas have been "cracked" (split across multiple districts) or "packed" (compressed into one district) for partisan gain. This analysis was conducted for North Carolina House of Representatives elections (2012-2024). North Carolina has been redistricted four times in the past ten years, unusually frequent as most states redistrict decennially, making it a valuable case study. By comparing persistence barcodes at the precinct and district levels (using the bottleneck distance), we show that precinct level voting patterns do not significantly fluctuate biannually, while district level patterns do, suggesting that shifts are likely a result of redistricting rather than voter behavior, providing strong evidence of gerrymandering. This research presents a novel application of topological data analysis in evaluating gerrymandering and shows persistent homology can be useful in discerning gerrymandered districts.

Related papers

• Drawing a Map of Elections [53.92343633736932]
  A map of elections consists of three main elements: a dataset of elections, a way of measuring similarities between these elections, and a representation of the elections in the 2D Euclidean space as points.<n>We show how coloring the elections in a map according to various criteria helps in analyzing results of a number of experiments.
  arXiv  Detail & Related papers  (2025-04-04T11:44:56Z)
• States of Disarray: Cleaning Data for Gerrymandering Analysis [0.0]
  We have made data for 22 states available for researchers, students, and the general public to easily access and analyze.<n>At the time of submission, we have data for 22 states available for researchers, students, and the general public to easily access and analyze.
  arXiv  Detail & Related papers  (2025-03-14T19:33:00Z)
• Efficient Lower Bounding of Single Transferable Vote Election Margins [56.12949230611067]
  Single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections.<n>The margin of victory, or simply'margin', is the smallest number of ballots that need to be manipulated to alter the set of winners.<n>Lower bounds on the margin can also be used for this purpose, in cases where exact margins are difficult to compute.
  arXiv  Detail & Related papers  (2025-01-24T13:39:23Z)
• Optimal bounds for dissatisfaction in perpetual voting [84.02572742131521]
  We consider a perpetual approval voting method that guarantees that no voter is dissatisfied too many times.<n>We identify a sufficient condition on voter behavior under which a sublinear growth of dissatisfaction is possible.<n>We present a voting method with sublinear guarantees on dissatisfaction under bounded conflicts, based on the standard techniques from prediction with expert advice.
  arXiv  Detail & Related papers  (2024-12-20T19:58:55Z)
• Don't Trust A Single Gerrymandering Metric [0.0]
  We show that each of these metrics is gameable when used as a single, isolated quantity to detect gerrymandering.<n>We do this by using a hill-climbing method to generate district plans that are constrained by the bounds on the metric but also maximize or nearly maximize the number of districts won by a party.<n>One clear consequence of these results is that they demonstrate the folly of specifying a priori bounds on a metric that a redistricting commission must meet in order to avoid gerrymandering.
  arXiv  Detail & Related papers  (2024-09-25T02:40:09Z)
• Representation Bias in Political Sample Simulations with Large Language Models [54.48283690603358]
  This study seeks to identify and quantify biases in simulating political samples with Large Language Models. Using the GPT-3.5-Turbo model, we leverage data from the American National Election Studies, German Longitudinal Election Study, Zuobiao dataset, and China Family Panel Studies.
  arXiv  Detail & Related papers  (2024-07-16T05:52:26Z)
• Efficient Weighting Schemes for Auditing Instant-Runoff Voting Elections [57.67176250198289]
  AWAIRE involves adaptively weighted averages of test statistics, essentially "learning" an effective set of hypotheses to test. We explore schemes and settings more extensively, to identify and recommend efficient choices for practice. A limitation of the current AWAIRE implementation is its restriction to a small number of candidates.
  arXiv  Detail & Related papers  (2024-02-18T10:13:01Z)
• Untangling the Dueling Expert Witnesses: Comparing Ensemble Methods in Pennsylvania's Redistricting Plans [0.0]
  Ensembles of random legislative districts are a valuable tool for assessing whether a proposed district plan is an outlier or gerrymander. Recent open source methods now permit independent validation of expert witness testimony. We compare ensembles for the Pennsylvania House and Congressional districts calculated using "Redist" and "Gerrychain"
  arXiv  Detail & Related papers  (2022-08-18T00:03:40Z)
• Deconstructing Self-Supervised Monocular Reconstruction: The Design Decisions that Matter [63.5550818034739]
  This paper presents a framework to evaluate state-of-the-art contributions to self-supervised monocular depth estimation. It includes pretraining, backbone, architectural design choices and loss functions. We re-implement, validate and re-evaluate 16 state-of-the-art contributions and introduce a new dataset.
  arXiv  Detail & Related papers  (2022-08-02T14:38:53Z)
• Robust Self-Tuning Data Association for Geo-Referencing Using Lane Markings [44.4879068879732]
  This paper presents a complete pipeline for resolving ambiguities during the data association. Its core is a robust self-tuning data association that adapts the search area depending on the entropy of the measurements. We evaluate our method on real data from urban and rural scenarios around the city of Karlsruhe in Germany.
  arXiv  Detail & Related papers  (2022-07-28T12:29:39Z)
• Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning [58.23459346724491]
  We use the "map of elections" approach of Szufa et al. (AAMAS 2020) to analyze several well-known vote distributions. We draw the "skeleton map" of distributions, evaluate its robustness, and analyze its properties.
  arXiv  Detail & Related papers  (2022-05-16T17:40:22Z)
• Mathematically Quantifying Non-responsiveness of the 2021 Georgia Congressional Districting Plan [3.097163558730473]
  We use a Metropolized-sampling technique through a parallel tempering method combined with ReCom. We develop these improvements through the first case study of district plans in Georgia. Our analysis projects that any election in Georgia will reliably elect 9 Republicans and 5 Democrats under the enacted plan.
  arXiv  Detail & Related papers  (2022-03-13T02:58:32Z)
• Implications of Distance over Redistricting Maps: Central and Outlier Maps [10.318010762465939]
  In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative.<n>A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost-equal population.<n>This enables a partisan legislature to gerrymander by choosing a map which unfairly favors it.
  arXiv  Detail & Related papers  (2022-03-02T04:59:30Z)
• Mathematical Analysis of Redistricting in Utah [0.0]
  We discuss difficulties of evaluating partisan gerrymandering in the congressional districts in Utah. We explain why the Republican vote share in the least-Republican district (LRVS) is a good indicator of the advantage or disadvantage each party has in the Utah congressional districts. We also discuss the implications of this new metric and our results on the question of whether the 2011 Utah congressional plan was gerrymandered.
  arXiv  Detail & Related papers  (2021-07-12T15:38:34Z)
• Colorado in Context: Congressional Redistricting and Competing Fairness Criteria in Colorado [0.0]
  We generate a large random sample of reasonable redistricting plans and determine the partisan balance of each district using returns from state-wide elections in 2018. We investigate the relationships between partisan outcomes, number of counties which are split, and number of competitive districts in a plan.
  arXiv  Detail & Related papers  (2020-11-11T20:05:50Z)
• Receptive Multi-granularity Representation for Person Re-Identification [46.99913453669368]
  This paper proposes a receptive multi-granularity learning approach to facilitate stripe-based feature learning. By two-branch network architecture, different scales of discriminative identity representation can be learned. Our approach achieves a state-of-the-art accuracy of 96.2%@Rank-1 or 90.0%@mAP on the challenging Market-1501 benchmark.
  arXiv  Detail & Related papers  (2020-08-31T09:26:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.