A retrospective analysis of Montana's 2020 congressional redistricting map

• URL: http://arxiv.org/abs/2402.03551v1
• Date: Mon, 5 Feb 2024 22:11:37 GMT
• Title: A retrospective analysis of Montana's 2020 congressional redistricting map
• Authors: Kelly McKinnie and Erin Szalda-Petree
• Abstract summary: The state of Montana underwent its redistricting process in 2021 in time for the November 2022 congressional elections, carving the state into two districts. This paper analyzes the redistricting process and compares the adopted congressional map to the space of all other possible maps.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The 2020 decennial census data resulted in an increase from one to two congressional representatives in the state of Montana. The state underwent its redistricting process in 2021 in time for the November 2022 congressional elections, carving the state into two districts. This paper analyzes the redistricting process and compares the adopted congressional map to the space of all other possible maps. In particular, we look at the population deviation, compactness and political outcomes of these maps. We also consider how well two popular sampling techniques, that sample from the space of possible maps, approximate the true distributions of these measures.

Related papers

• Has the Machine Learning Review Process Become More Arbitrary as the Field Has Grown? The NeurIPS 2021 Consistency Experiment [86.77085171670323]
  We present a larger-scale variant of the 2014 NeurIPS experiment in which 10% of conference submissions were reviewed by two independent committees to quantify the randomness in the review process. We observe that the two committees disagree on their accept/reject recommendations for 23% of the papers and that, consistent with the results from 2014, approximately half of the list of accepted papers would change if the review process were randomly rerun.
  arXiv  Detail & Related papers  (2023-06-05T21:26:12Z)
• Design and analysis of tweet-based election models for the 2021 Mexican legislative election [55.41644538483948]
  We use a dataset of 15 million election-related tweets in the six months preceding election day. We find that models using data with geographical attributes determine the results of the election with better precision and accuracy than conventional polling methods.
  arXiv  Detail & Related papers  (2023-01-02T12:40:05Z)
• Mathematically Quantifying Non-responsiveness of the 2021 Georgia Congressional Districting Plan [3.097163558730473]
  We use a Metropolized-sampling technique through a parallel tempering method combined with ReCom. We develop these improvements through the first case study of district plans in Georgia. Our analysis projects that any election in Georgia will reliably elect 9 Republicans and 5 Democrats under the enacted plan.
  arXiv  Detail & Related papers  (2022-03-13T02:58:32Z)
• Implications of Distance over Redistricting Maps: Central and Outlier Maps [6.757783454836096]
  In representative democracy, a redistricting map is chosen to partition an electorate into a collection of districts each of which elects a representative. A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost equal population. This fact introduces a difficulty in drawing redistricting maps and it also enables a partisan legislature to possibly gerrymander by choosing a map which unfairly favors it.
  arXiv  Detail & Related papers  (2022-03-02T04:59:30Z)
• Measuring Geometric Similarity Across Possible Plans for Automated Redistricting [0.0]
  This paper briefly introduces an interpretive measure of similarity, and a corresponding assignment matrix, that corresponds to the percentage of a state's area or population that stays in the same congressional district between two plans. We then show how to calculate this measure in an intuitive time and briefly demonstrate some potential use-cases.
  arXiv  Detail & Related papers  (2021-11-17T03:37:25Z)
• Compact Redistricting Plans Have Many Spanning Trees [39.779544988993294]
  In the design and analysis of political redistricting maps, it is often useful to be able to sample from the space of all partitions of the graph of census blocks into connected subgraphs of equal population. In this paper, we establish an inverse exponential relationship between the total length of the boundaries separating districts and the probability that such a map will be sampled.
  arXiv  Detail & Related papers  (2021-09-27T23:36:01Z)
• Cascaded Residual Density Network for Crowd Counting [63.714719914701014]
  We propose a novel Cascaded Residual Density Network (CRDNet) in a coarse-to-fine approach to generate the high-quality density map for crowd counting more accurately. A novel additional local count loss is presented to refine the accuracy of crowd counting.
  arXiv  Detail & Related papers  (2021-07-29T03:07:11Z)
• Mundus vult decipi, ergo decipiatur: Visual Communication of Uncertainty in Election Polls [56.8172499765118]
  We discuss potential sources of bias in nowcasting and forecasting. Concepts are presented to attenuate the issue of falsely perceived accuracy. One key idea is the use of Probabilities of Events instead of party shares.
  arXiv  Detail & Related papers  (2021-04-28T07:02:24Z)
• Colorado in Context: Congressional Redistricting and Competing Fairness Criteria in Colorado [0.0]
  We generate a large random sample of reasonable redistricting plans and determine the partisan balance of each district using returns from state-wide elections in 2018. We investigate the relationships between partisan outcomes, number of counties which are split, and number of competitive districts in a plan.
  arXiv  Detail & Related papers  (2020-11-11T20:05:50Z)
• Political Geography and Representation: A Case Study of Districting in Pennsylvania [0.0]
  We investigate how much the partisan playing field is tilted by political geography. We find that partisan-neutral maps rarely give seats proportional to votes, and that making the district size smaller tends to make it even harder to find a proportional map.
  arXiv  Detail & Related papers  (2020-10-27T21:01:10Z)
• Distribution Matching for Crowd Counting [51.90971145453012]
  We show that imposing Gaussians to annotations hurts generalization performance. We propose to use Distribution Matching for crowd COUNTing (DM-Count) In terms of Mean Absolute Error, DM-Count outperforms the previous state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-09-28T04:57:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.