Statistics, Politics, Law and Gerrymandering

This post summarises my MSc dissertation (University of Leeds, 2021) on detecting partisan bias in electoral maps using Markov Chain Monte Carlo (MCMC), applied to Massachusetts. It blends statistics with legal context and shows how computational sampling can inform fairness debates.

Why MCMC for redistricting?

We rarely have access to the full space of all valid districting plans, so judging whether a given plan is an outlier is difficult. MCMC lets us sample from the space of valid plans and compare the plan in use against an ensemble using metrics like efficiency gap and partisan symmetry.

Data set and constraints

Two proposal functions

Boundary Flip

Iteratively flips a boundary node from one district to a neighbour, preserving validity constraints. Easy to explain but tends to produce long, snaky districts; mixes slowly and can struggle with contiguity.

Recombination ("ReCom")

Samples a pair of adjacent districts, builds an induced subgraph, draws a random spanning tree, and cuts an edge to form two new districts that meet constraints. Implies contiguity and produces more compact plans. Each step is heavier, but ensembles diversify faster.

Metrics

Results

Conclusion

Is Massachusetts gerrymandered? Based on the ensembles generated, I did not find concrete evidence that would meet a robust legal standard. Some bias appears at one adjustment level, but strong outlier evidence (e.g., more biased than 95% of sampled plans across conditions) wasn’t met given the sample sizes.

Further work

You can download the full dissertation here.