On the Complexity of Sampling Redistricting Plans

06/10/2022
by   Moses Charikar, et al.
0

A crucial task in the political redistricting problem is to sample redistricting plans i.e. a partitioning of the graph of census blocks into districts. We show that Recombination [DeFord-Duchin-Solomon'21]-a popular Markov chain to sample redistricting plans-is exponentially slow mixing on simple subgraph of ℤ_2. We show an alternative way to sample balance, compact and contiguous redistricting plans using a "relaxed" version of ReCom and rejection sampling.

READ FULL TEXT
research
09/27/2021

Compact Redistricting Plans Have Many Spanning Trees

In the design and analysis of political redistricting maps, it is often ...
research
08/23/2019

Complexity and Geometry of Sampling Connected Graph Partitions

In this paper, we prove intractability results about sampling from the s...
research
10/04/2022

Spanning tree methods for sampling graph partitions

In the last decade, computational approaches to graph partitioning have ...
research
10/31/2019

Recombination: A family of Markov chains for redistricting

Redistricting is the problem of partitioning a set of geographical units...
research
06/08/2022

Sampling-based techniques for designing school boundaries

Recently, an increasing number of researchers, especially in the realm o...
research
11/11/2020

Colorado in Context: Congressional Redistricting and Competing Fairness Criteria in Colorado

In this paper, we apply techniques of ensemble analysis to understand th...
research
11/17/2021

Measuring Geometric Similarity Across Possible Plans for Automated Redistricting

Algorithmic and statistical approaches to congressional redistricting ar...

Please sign up or login with your details

Forgot password? Click here to reset