English
Related papers

Related papers: Measuring Congressional District Meandering

200 papers

Consider an election where N seats are distributed among parties with proportions p_1,...,p_m of the votes. We study, for the common divisor and quota methods, the asymptotic distribution, and in particular the mean, of the seat excess of a…

Probability · Mathematics 2011-10-31 Svante Janson

When auditing a redistricting plan, a persuasive method is to compare the plan with an ensemble of neutrally drawn redistricting plans. Ensembles are generated via algorithms that sample distributions on balanced graph partitions. To audit…

Physics and Society · Physics 2024-02-01 Gabriel Chuang , Gregory Herschlag , Jonathan C. Mattingly

In this paper, we apply techniques of ensemble analysis to understand the political baseline for Congressional representation in Colorado. We generate a large random sample of reasonable redistricting plans and determine the partisan…

Computers and Society · Computer Science 2021-03-25 Jeanne Clelland , Haley Colgate , Daryl DeFord , Beth Malmskog , Flavia Sancier-Barbosa

When a capillary channel with corners is wetted by a fluid, there are regions where the fluid fills the whole cross-section and regions where only the corners are filled by the fluid. The fluid fraction of the partially-filled region,…

Soft Condensed Matter · Physics 2022-05-18 Tian Yu , Qicheng Sun , Chen Zhao , Jiajia Zhou , Masao Doi

Republican candidates often receive between 30 and 40 percent of the two-way vote share in statewide elections in Massachusetts. For the last three Census cycles, MA has held 9-10 seats in the House of Representatives, which means that a…

Using an ensemble of redistricting plans, we evaluate whether a given political districting faithfully represents the geo-political landscape. Redistricting plans are sampled by a Monte Carlo algorithm from a probability distribution that…

We introduce a novel partial differential equations approach for addressing the problem of partisan gerrymandering. Our method is based on volume preserving curvature flow, a partial differential equation which we adapt to smooth voting…

Physics and Society · Physics 2018-06-21 Matt Jacobs , Olivia Walch

In the computational study of political redistricting, feasibility necessitates the use of a discretization of regions such as states, counties, and towns. In nearly all cases, researchers use a dual graph, whose vertices represent small…

Discrete Mathematics · Computer Science 2026-04-08 Sara Anderson , Sarah Cannon , Brooke Feinberg , Anne Friedman

In this paper we study the statistical properties of convex hulls of $N$ random points in a plane chosen according to a given distribution. The points may be chosen independently or they may be correlated. After a non-exhaustive survey of…

Statistical Mechanics · Physics 2010-03-31 Satya N. Majumdar , Alain Comtet , Julien Randon-Furling

Measure what is measurable, and make measurable what is not so (Galileo Galilei). According to the above sentence we do not ask why we need to measure democracy but if it is possible to measure something which is not unequivocally defined.…

Physics and Society · Physics 2015-10-14 Jozef Sznajd

We introduce a non-partisan probability distribution on congressional redistricting of North Carolina which emphasizes the equal partition of the population and the compactness of districts. When random districts are drawn and the results…

Physics and Society · Physics 2014-11-03 Jonathan C. Mattingly , Christy Vaughn

We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…

Statistical Mechanics · Physics 2015-06-11 Gunnar Claussen , Alexander K. Hartmann , Satya N. Majumdar

For the perimeter length and the area of the convex hull of the first $n$ steps of a planar random walk, we study $n \to \infty$ mean and variance asymptotics and establish non-Gaussian distributional limits. Our results apply to random…

Probability · Mathematics 2015-09-25 Andrew R. Wade , Chang Xu

Forecasting elections -- a challenging, high-stakes problem -- is the subject of much uncertainty, subjectivity, and media scrutiny. To shed light on this process, we develop a method for forecasting elections from the perspective of…

Physics and Society · Physics 2020-09-21 Alexandria Volkening , Daniel F. Linder , Mason A. Porter , Grzegorz A. Rempala

This past decade has seen a noticeable uptick in asymmetric election results along with the inevitable claims of gerrymandering and litigation. Research, too, has followed, giving rise to intense scrutiny of elections, where the goal is to…

Physics and Society · Physics 2019-01-28 Ray J Wallin

Hamiltonian systems that are either open, leaking, or contain holes in the phase space possess solutions that eventually escape the system's domain. The motion described by such escape orbits before crossing the escape threshold can be…

Chaotic Dynamics · Physics 2022-05-10 Vitor M. de Oliveira , Matheus S. Palmero , Iberê L. Caldas

Fractal geometry of random curves appearing in the scaling limit of critical two-dimensional statistical systems is characterized by their harmonic measure and winding angle. The former is the measure of the jaggedness of the curves while…

Statistical Mechanics · Physics 2008-07-01 A. Belikov , I. A. Gruzberg , I. Rushkin

We explore the possibility of discovering extreme voting patterns in the U.S. Congressional voting records by drawing ideas from the mixture of contaminated normal distributions. A mixture of latent trait models via contaminated normal…

Methodology · Statistics 2018-05-14 Yang Tang , Paul D. McNicholas , Antonio Punzo

We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting…

Computer Science and Game Theory · Computer Science 2017-03-01 Palash Dey , Nimrod Talmon , Otniel van Handel

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

Computational Geometry · Computer Science 2017-06-16 Robert Graham , Adam M. Oberman