Redistricting: Drawing the Line

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 redistrictings, we find that the number of democratic and republican representatives elected varies drastically depending on how districts are drawn. Some results are more common, and we gain a clear range of expected election outcomes. Using the statistics of our generated redistrictings, we critique the particular congressional districtings used in the 2012 and 2016 NC elections as well as a districting proposed by a bipartisan redistricting commission. We find that the 2012 and 2016 districtings are highly atypical and not representative of the will of the people. On the other hand, our results indicate that a plan produced by a bipartisan panel of retired judges is highly typical and representative. Since our analyses are based on an ensemble of reasonable redistrictings of North Carolina, they provide a baseline for a given election which incorporates the geometry of the state's population distribution.

[1]  J. Mattingly,et al.  Redistricting and the Will of the People , 2014, 1410.8796.

[2]  C. Cirincione,et al.  Assessing South Carolina's 1990s congressional districting , 2000 .

[3]  John M. Liittschwager,et al.  Legislative districting by computer , 1969 .

[4]  G. Nemhauser,et al.  An Optimization Based Heuristic for Political Districting , 1998 .

[5]  U. Hansmann.  Parallel tempering algorithm for conformational studies of biological molecules , 1997, physics/9710041.

[6]  A. Frieze,et al.  Assessing significance in a Markov chain without mixing , 2016, Proceedings of the National Academy of Sciences.

[7]  Richard G. Niemi,et al.  Expressive Harms, "Bizarre Districts," and Voting Rights: Evaluating Election-District Appearances After Shaw v. Reno , 1993 .

[8]  S. Nagel.  Simplified Bipartisan Computer Redistricting , 1965 .

[9]  Y LiuYan,et al.  Toward a Talismanic Redistricting Tool: A Computational Method for Identifying Extreme Redistricting Plans , 2016 .

[10]  ChenJowei,et al.  Cutting Through the Thicket: Redistricting Simulations and the Detection of Partisan Gerrymanders , 2015 .

[11]  W. Macmillan,et al.  Redistricting in a GIS environment: An optimisation algorithm using switching-points , 2001, J. Geogr. Syst..

[12]  Jonathan Rodden,et al.  Unintentional Gerrymandering: Political Geography and Electoral Bias in Legislatures , 2013 .

[13]  Kosuke Imai,et al.  A New Automated Redistricting Simulator Using Markov Chain , 2014 .

[14]  Shaowen Wang,et al.  PEAR: a massively parallel evolutionary computation approach for political redistricting optimization and analysis , 2016, Swarm Evol. Comput..

[15]  Yan Y. Liu,et al.  Toward a Talismanic Redistricting Tool: A Computational Method for Identifying Extreme Redistricting Plans , 2016 .

[16]  Emile H. L. Aarts,et al.  Performance of the simulated annealing algorithm , 1987 .

[17]  David Miller,et al.  Impartial Redistricting: A Markov Chain Approach , 2015, ArXiv.

[18]  J D Thoreson,et al.  Computers in behavioral science. Legislative districting by computer simulation. , 1967, Behavioral science.