2 citations · 3 across the 5 of their papers we have counts for
5 papers
Connectivity of Districting Metagraphs
Mehmet Emre, Daniel C. Jerison, Ellen Veomett
In this article, we prove irreducibility results for a family of Markov chains arising in the study of redistricting and detecting gerrymandering. These chains use ReCom moves as t…
States of Disarray: Cleaning Data for Gerrymandering Analysis
Ananya Agarwal, Fnu Alusi, Arbie Hsu +2
The mathematics of redistricting is an area of study that has exploded in recent years. In particular, many different research groups and expert witnesses in court cases have used…
The Intersectionality Problem for Algorithmic Fairness
Johannes Himmelreich, Arbie Hsu, Kristian Lum +1
A yet unmet challenge in algorithmic fairness is the problem of intersectionality, that is, achieving fairness across the intersection of multiple groups -- and verifying that such…
Don't Trust A Single Gerrymandering Metric
Thomas Ratliff, Stephanie Somersille, Ellen Veomett
In recent years, in an effort to promote fairness in the election process, a wide variety of techniques and metrics have been proposed to determine whether a map is a partisan gerr…
Bounds and Bugs: The Limits of Symmetry Metrics to Detect Partisan Gerrymandering
Daryl DeFord, Ellen Veomett
We consider two symmetry metrics commonly used to analyze partisan gerrymandering: the Mean-Median Difference (MM) and Partisan Bias (PB). Our main results compare, for combination…