Implications of Distance over Redistricting Maps: Central and Outlier Maps
Seyed A. Esmaeili, Darshan Chakrabarti, Hayley Grape, Brian Brubach

TL;DR
This paper introduces a new distance measure for redistricting maps that identifies typical and outlier maps, aiding in gerrymandering detection without relying on election results.
Contribution
It proposes an interpretable, election-independent distance measure and algorithms for identifying central and outlier redistricting maps, with theoretical and practical analysis.
Findings
The central map mirrors Kemeny ranking.
The framework detects gerrymandered maps effectively.
Outlier maps are far from the central map in the ensemble.
Abstract
In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative. A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost-equal population. However, these constraints are loose enough to enable an enormous ensemble of valid redistricting maps. This enables a partisan legislature to gerrymander by choosing a map which unfairly favors it. In this paper, we introduce an interpretable and tractable distance measure over redistricting maps which does not use election results and study its implications over the ensemble of redistricting maps. Specifically, we define a central map which may be considered "most typical" and give a rigorous justification for it by showing that it mirrors the Kemeny ranking in a scenario where we have a committee voting over a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsBenford’s Law and Fraud Detection
