2017
DOI: 10.48550/arxiv.1704.03360
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Redistricting: Drawing the Line

Abstract: We develop methods to evaluate whether a political districting accurately represents the will of the people. To explore and showcase our ideas, we concentrate on the congressional districts for the U.S. House of Representatives and use the state of North Carolina and its redistrictings since the 2010 census. Using a Monte Carlo algorithm, we randomly generate over 24,000 redistrictings that are non-partisan and adhere to criteria from proposed legislation. Applying historical voting data to these random redist… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(31 citation statements)
references
References 7 publications
0
31
0
Order By: Relevance
“…If we restrict points to deviate only when the interval they create has exactly σ points, this sharp threshold holds for all ε ≤ 1/3. To interpret this result, when ε = 1/3, this means there is a fair partition where all intervals have size in the range 2 3 σ, 4 3 σ , and no subset of unhappy points can create an interval with σ points, where they form 2/3-majority. Furthermore, there is an instance where the bound of 2/3 on the majority cannot be reduced any further.…”
Section: Our Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…If we restrict points to deviate only when the interval they create has exactly σ points, this sharp threshold holds for all ε ≤ 1/3. To interpret this result, when ε = 1/3, this means there is a fair partition where all intervals have size in the range 2 3 σ, 4 3 σ , and no subset of unhappy points can create an interval with σ points, where they form 2/3-majority. Furthermore, there is an instance where the bound of 2/3 on the majority cannot be reduced any further.…”
Section: Our Resultsmentioning
confidence: 99%
“…There has been extensive work on redistricting algorithms, going back to 1960s [19], for constructing contiguous, compact, and balanced districts. Many different approaches, including integer programming [17], simulated annealing [1], evolutionary algorithms [22], Voronoi diagram based methods [12,29], MCMC methods [4,13], have been proposed; see [5] for a recent survey. A line of work on redistricting algorithms focuses on combating manipulation such as gerrymandering: when district plans have been engineered to provide advantage to individual candidates or to parties [6].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Research has focused on exploring the space of all possible district maps that meet certain basic criteria. Since this space is computationally intractable, even for relatively small instances, randomized algorithms play an important role in finding "average" district maps under suitable distributions [3]. Being an outlier may indicate that gerrymandering has been applied in the drawing of a given map [20].…”
Section: Introductionmentioning
confidence: 99%
“…In 2018, the Pennsylvania Supreme Court struck down the 2011 congressional map as an unconstitutional partisan gerrymander; here, the plantiffs leveraged Markov Chain-based techniques to sample the space of admissible maps and make informative comparisons with the map in question [5]. This trend of policing partisan gerrymandering in the courts has led to a flurry of relevant mathematical research, primarily in Markov Chain Monte Carlo sampling methods [6,3,9,8,16] and in evaluating various fairness criteria [4,14,1,2,10]. However, in light of recent changes to the U.S. Supreme Court bench, a new approach might be necessary to effectively combat partisan gerrymandering in the future.…”
Section: Introductionmentioning
confidence: 99%