Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.02390

The (homological) persistence of gerrymandering

Moon Duchin·Tom Needham·Thomas Weighill
View original source ↗Read source document ↗Export metadata ↓

Abstract

We apply persistent homology, the dominant tool from the field of topological data analysis, to study electoral redistricting. Our method combines the geographic information from a political districting plan with election data to produce a persistence diagram. We are then able to visualize and analyze large ensembles of computer-generated districting plans of the type commonly used in modern redistricting research (and court challenges). We set out three applications: zoning a state at each scale of districting, comparing elections, and seeking signals of gerrymandering. Our case studies focus on redistricting in Pennsylvania and North Carolina, two states whose legal challenges to enacted plans have raised considerable public interest in the last few years. To address the question of robustness of the persistence diagrams to perturbations in vote data and in district boundaries, we translate the classical stability theorem of Cohen--Steiner et al. into our setting and find that it can be phrased in a manner that is easy to interpret. We accompany the theoretical bound with an empirical demonstration to illustrate diagram stability in practice.

Explore related subjects

math.ATphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Moon Duchin, Tom Needham, Thomas Weighill. 2020-07-05. The (homological) persistence of gerrymandering. https://arxiv.org/abs/2007.02390

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Finite Topological Space Filtrations: A Topological Framework for Data Analysis

We introduce a data-analysis framework based on filtrations of finite topological spaces. Starting from a finite metric data set, we construct a sequence of coarsening topologies on the same set of points. These topologies give persistence modules and barcodes in the usual way, but they also retain information that is lost when the filtration is reduced to homology. At each level one can examine, for example, which points are topologically indistinguishable, how their minimal neighbourhoods overlap, how connected components merge, and how these features change from one level to the next. We develop the basic theory of these filtrations, establish stability results under suitable hypotheses, and give practical constructions starting directly from a distance matrix. We then study what can be learned from the resulting finite topologies. On synthetic data with known clusters of different shapes, sizes, and densities, we examine how these regions appear among the finite-topological structures and how they merge as the topology coarsens. We also study what happens when points that become uncovered early in the construction are removed and the analysis is repeated. For one-dimensional homology, we use paths in the finite-topological structure to locate cycles and to examine how their appearance is related to the geometry of the data. We finally apply these ideas to two real data sets with quite different structures. On the Paul15 single-cell data, we use the evolving finite topology to examine fine cellular states, their overlaps and relations, their assembly into larger groups, and the effect of removing points that connect these structures. On COIL20, where images of an object are sampled through a full rotation, we study how the cyclic organization of the images is reflected in the finite-topological evolution and in the associated one-dimensional homology.

math.AT↗
arXiv2026

Persistent Simple-homotopy invariants via discrete Morse theory

Persistent homology records the evolution of homological features along a filtration, but does not retain finer information related to simple-homotopy theory. In this paper, we develop two approaches to capturing such information for filtered simplicial complexes. We first introduce the Morse complexity profile, which records the minimal number of critical simplices at each filtration level. We study its invariance and stability properties and develop computable approximations using several discrete Morse matchings. We then introduce a persistent version of Whitehead torsion and show that it is invariant under both levelwise homotopy equivalence and interleaving equivalence of filtrations.

math.AT↗
arXiv2026

Signed GLMY Homology of Signed Graphs via Double Covers

We define a signed GLMY chain complex over $\mathbb{R}$ for signed digraphs using sheet-labelled regular paths. The complex is naturally isomorphic to the deck anti-invariant subcomplex of the ordinary GLMY complex on the signed double cover. The double-cover realization yields switching invariance and recovers ordinary GLMY homology for switching-balanced signings. Bidirected completion gives an orientation-independent homology theory for signed graphs. For a signed graph, the zero-dimensional homology identifies with the kernel of the signed Laplacian and has dimension equal to the number of balanced connected components. Signed GLMY homology is functorial under signed weak morphisms, which combine vertex maps with switching functions and allow compatible arrow contractions. For signed digraphs, the all-positive reduction retains the orientation sensitivity of ordinary GLMY homology, while explicit computations show additional sensitivity to the arrow signs. For a fixed digraph with five vertices and nine arrows, we classify all 512 arrow signings and obtain exactly four signed Betti vectors. Precisely 16 signings have nonzero second signed GLMY homology.

math.AT↗