DeepAI AI Chat
Log In Sign Up

Three Applications of Entropy to Gerrymandering

by   Larry Guth, et al.

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. (


page 1

page 2

page 7

page 8

page 11

page 12


Redistricting Algorithms

Why not have a computer just draw a map? This is something you hear a lo...

Political Geography and Representation: A Case Study of Districting in Pennsylvania

This preprint offers a detailed look, both qualitative and quantitative,...

Using the Dafermos Entropy Rate Criterion in Numerical Schemes

The following work concerns the construction of an entropy dissipative f...

Jaynes Shannon's Constrained Ignorance and Surprise

In this simple article, with possible applications in theoretical and ap...

Strategic model reduction by analysing model sloppiness: a case study in coral calcification

It can be difficult to identify ways to reduce the complexity of large m...

Maximum Entropy and the Glasses You Are Looking Through

We give an interpretation of the Maximum Entropy (MaxEnt) Principle in g...

Higher order information volume of mass function

For a certain moment, the information volume represented in a probabilit...