Empirical sampling of connected graph partitions for redistricting
The space of connected graph partitions underlies statistical models used as evidence in court cases and reform efforts that analyze political districting plans. In response to the demands of redistricting applications, researchers have developed sampling methods that traverse this space, building o...
Main Authors: | Najt, Elle (Author), DeFord, Daryl (Author), Solomon, Justin (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society (APS),
2022-07-20T15:51:25Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Recombination: A Family of Markov Chains for Redistricting
by: DeFord, Daryl, et al.
Published: (2022) -
The Essential Role of Empirical Validation in Legislative Redistricting Simulation
by: Benjamin Fifield, et al.
Published: (2020-01-01) -
Algorithmic Congressional Redistricting
by: Whaley, Gareth A.
Published: (2019) -
A Computational Approach to Measuring Vote Elasticity and Competitiveness
by: Daryl DeFord, et al.
Published: (2020-01-01) -
BARD: Better Automated Redistricting
by: Micah Altman, et al.
Published: (2011-08-01)