Three Applications of Entropy to Gerrymandering

10/28/2020
by   Larry Guth, et al.
0

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)

READ FULL TEXT

page 1

page 2

page 7

page 8

page 11

page 12

research
11/18/2020

Redistricting Algorithms

Why not have a computer just draw a map? This is something you hear a lo...
research
10/27/2020

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

This preprint offers a detailed look, both qualitative and quantitative,...
research
02/28/2022

Using the Dafermos Entropy Rate Criterion in Numerical Schemes

The following work concerns the construction of an entropy dissipative f...
research
07/11/2021

Jaynes Shannon's Constrained Ignorance and Surprise

In this simple article, with possible applications in theoretical and ap...
research
04/12/2022

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...
research
01/16/2013

Maximum Entropy and the Glasses You Are Looking Through

We give an interpretation of the Maximum Entropy (MaxEnt) Principle in g...
research
05/10/2022

Magnitude and topological entropy of digraphs

Magnitude and (co)weightings are quite general constructions in enriched...

Please sign up or login with your details

Forgot password? Click here to reset