The Essential Role of Empirical Validation in Legislative Redistricting Simulation

References

• Altman, M. (1997), “The Computational Complexity of Automated Redistricting: Is Automation the Answer,” Rutgers Computer & Technology Law Journal, 23, 81–142.
   Google Scholar
• Altman, M., and McDonald, M. P. (2011), “BARD: Better Automated Redistricting,” Journal of Statistical Software, 42, 1–28. DOI: 10.18637/jss.v042.i04.
   Web of Science ®Google Scholar
• Carter, D., Herschlag, G., Hunter, Z., and Mattingly, J. (2019), “A Merge-Split Proposal for Reversible Monte Carlo Markov Chain Sampling of Redistricting Plans,” Tech. Rep., arXiv no. 1911.01503.
   Google Scholar
• Chen, J., and Rodden, J. (2013), “Unintentional Gerrymandering: Political Geography and Electoral Bias in Legislatures,” Quarterly Journal of Political Science, 8, 239–269. DOI: 10.1561/100.00012033.
   Web of Science ®Google Scholar
• Chikina, M., Frieze, A., and Pegden, W. (2017), “Assessing Significance in a Markov Chain Without Mixing,” Proceedings of the National Academy of Sciences of the United States of America, 114, 2860–2864. DOI: 10.1073/pnas.1617540114.
   PubMed Web of Science ®Google Scholar
• Cirincione, C., Darling, T. A., and O’Rourke, T. G. (2000), “Assessing South Carolina’s 1990s Congressional Districting,” Political Geography, 19, 189–211. DOI: 10.1016/S0962-6298(99)00047-5.
   Web of Science ®Google Scholar
• DeFord, D., Duchin, M., and Solomon, J. (2019), “Recombination: A Family of Markov Chains for Redistricting,” Tech. Rep., arXiv no. 1911.05725.
   Google Scholar
• Fifield, B., Higgins, M., Imai, K., and Tarr, A. (2014), “A New Automated Redistricting Simulator Using Markov Chain Monte Carlo,” Tech. Rep., Presented at the 31th Annual Meeting of the Society for Political Methodology, University of Georgia.
   Google Scholar
• Fifield, B., Higgins, M., Imai, K., and Tarr, A. (2020), “Automated Redistricting Simulator Using Markov Chain Monte Carlo,” Journal of Computational and Graphical Statistics (forthcoming).
   Web of Science ®Google Scholar
• Fifield, B., Imai, K., Kawahara, J., and Kenny, C. T. (2020), “Replication Data for: The Essential Role of Empirical Validation in Legislative Redistricting Simulation,” available at https://doi.org/10.7910/DVN/NH4CRS.
   Google Scholar
• Fifield, B., Tarr, A., and Imai, K. (2015), “redist: Markov Chain Monte Carlo Methods for Redistricting Simulation,” Comprehensive R Archive Network (CRAN), available at https://CRAN.R-project.org/package=redist.
   Google Scholar
• Fryer, R. G., and Holden, R. (2011), “Measuring the Compactness of Political Districting Plans,” The Journal of Law and Economics, 54, 493–535. DOI: 10.1086/661511.
   Web of Science ®Google Scholar
• Gelman, A., and Rubin, D. B. (1992), “Inference From Iterative Simulations Using Multiple Sequences” (with discussion), Statistical Science, 7, 457–472. DOI: 10.1214/ss/1177011136.
   Google Scholar
• Herschlag, G., Ravier, R., and Mattingly, J. C. (2017), “Evaluating Partisan Gerrymandering in Wisconsin,” Tech. Rep., Department of Mathematics, Duke University.
   Google Scholar
• Hess, S. W., Weaver, J. B., Siegfeldt, H. J., Whelan, J. N., and Zitlau, P. A. (1965), “Nonpartisan Political Redistricting by Computer,” Operations Research, 13, 998–1006. DOI: 10.1287/opre.13.6.998.
   Web of Science ®Google Scholar
• Katz, J., King, G., and Rosenblatt, E. (2020), “Theoretical Foundations and Empirical Evaluations of Partisan Fairness in District-Based Democracies,” American Political Science Review, 114, 164–178. DOI: 10.1017/S000305541900056X.
   Web of Science ®Google Scholar
• Kawahara, J., Horiyama, T., Hotta, K., and Minato, S. (2017), “Generating All Patterns of Graph Partitions Within a Disparity Bound,” in Proceedings of the 11th International Conference and Workshops on Algorithms and Computation, Vol. 10167, pp. 119–131.
   Google Scholar
• Knuth, D. E. (2011), The Art of Computer Programming: Combinatorial Algorithms, Part I (Vol. 4A), New York: Addison-Wesley.
   Google Scholar
• Liu, Y. Y., Tam Cho, W. K., and Wang, S. (2016), “PEAR: A Massively Parallel Evolutionary Computation Approach for Political Redistricting Optimization and Analysis,” Swarm and Evolutionary Computation, 30, 78–92.
   Web of Science ®Google Scholar
• Magleby, D., and Mosesson, D. (2018), “A New Approach for Developing Neutral Redistricting Plans,” Political Analysis, 26, 147–167. DOI: 10.1017/pan.2017.37.
   Web of Science ®Google Scholar
• Massey, D. S., and Denton, N. A. (1988), “The Dimensions of Residential Segregation,” Social Forces, 67, 281–315. DOI: 10.2307/2579183.
   Web of Science ®Google Scholar
• Mattingly, J. C., and Vaughn, C. (2014), “Redistricting and the Will of the People,” Tech. Rep., Department of Mathematics, Duke University.
   Google Scholar
• McCarty, N., Poole, K. T., and Rosenthal, H. (2009), “Does Gerrymandering Cause Polarization?,” American Journal of Political Science, 53, 666–680. DOI: 10.1111/j.1540-5907.2009.00393.x.
   Web of Science ®Google Scholar
• Mehrotra, A., Johnson, E., and Nemhauser, G. L. (1998), “An Optimization Based Heuristic for Political Districting,” Management Science, 44, 1100–1114. DOI: 10.1287/mnsc.44.8.1100.
   Web of Science ®Google Scholar
• Minato, S. (1993), “Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems,” in Proceedings of the 30th ACM/IEEE Design Automation Conference, pp. 272–277.
   Google Scholar
• Nagel, S. S. (1965), “Simplified Bipartisan Computer Redistricting,” Stanford Law Journal, 17, 863–899. DOI: 10.2307/1226994.
   Web of Science ®Google Scholar
• Rubin, D. B. (1987), “Comment: A Noniterative Sampling/Importance Resampling Alternative to the Data Augmentation Algorithm for Creating a Few Imputation When Fractions of Missing Information Are Modest: The SIR Algorithm,” Journal of the American Statistical Association, 82, 543–546. DOI: 10.2307/2289460.
   Web of Science ®Google Scholar
• Vickrey, W. (1961), “On the Prevention of Gerrymandering,” Political Science Quarterly, 76, 105–110. DOI: 10.2307/2145973.
   Web of Science ®Google Scholar
• Weaver, J. B., and Hess, S. W. (1963), “A Procedure for Nonpartisan Districting: Development of Computer Techniques,” Yale Law Journal, 73, 288–308. DOI: 10.2307/794769.
   Web of Science ®Google Scholar