Voting Rights, Markov Chains, and Optimization by Short Bursts

DOI10.48550/ARXIV.2011.02288zbMath1515.60026arXiv2011.02288OpenAlexW3097040850MaRDI QIDQ58522

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

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

optimizationMarkov chainrandom walkredistrictingoutlier analysisvoting rights

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Computational methods for problems pertaining to probability theory (60-08) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (2)

Irreducibility of recombination Markov chains in the triangular lattice ⋮ redist

Cites Work

• Assessing significance in a Markov chain without mixing
• Unnamed Item

This page was built for publication: Voting Rights, Markov Chains, and Optimization by Short Bursts