Three Applications of Entropy to Gerrymandering

TL;DR

This paper explores how the mathematical concept of entropy can be applied to redistricting and gerrymandering, demonstrating its potential to inform and analyze districting problems through multiple applications.

Contribution

It introduces three novel applications of entropy to gerrymandering, illustrating its usefulness as a mathematical tool in redistricting analysis.

Findings

Entropy provides new insights into districting fairness.

The applications demonstrate entropy's versatility in redistricting.

Mathematical approaches can enhance understanding of gerrymandering issues.

Abstract

This preprint is an exploration in how a single mathematical idea - entropy - can be applied to redistricting in a number of ways. It's meant to be read not so much as a call to action for entropy, but as a case study illustrating one of the many ways math can inform our thinking on redistricting problems. This preprint was prepared as a chapter in the forthcoming edited volume Political Geometry, an interdisciplinary collection of essays on redistricting. (mggg.org/gerrybook)