Voting Rights, Markov Chains, and Optimization by Short Bursts

DOI10.48550/arXiv.2011.02288zbMath1515.60026arXiv2011.02288MaRDI QIDQ58522

Sarah Cannon, Ari Goldbloom-Helzner, Varun Gupta, Jn Matthews, Bhushan Suwal

Publication date: 23 October 2020

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.02288

zbMATH Keywords

optimization; Markov chain; random walk; redistricting; outlier analysis; voting rights

Mathematics Subject Classification ID

60J22: Computational methods in Markov chains

60-08: Computational methods for problems pertaining to probability theory

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

Related Items

redist