Non-reversible Markov chain Monte Carlo for sampling of districting maps
arXiv:2008.07843
Abstract
Evaluating the degree of partisan districting (Gerrymandering) in a statistical framework typically requires an ensemble of districting plans which are drawn from a prescribed probability distribution that adheres to a realistic and non-partisan criteria. In this article we introduce novel non-reversible Markov chain Monte-Carlo (MCMC) methods for the sampling of such districting plans which have improved mixing properties in comparison to previously used (reversible) MCMC algorithms. In doing so we extend the current framework for construction of non-reversible Markov chains on discrete sampling spaces by considering a generalization of skew detailed balance. We provide a detailed description of the proposed algorithms and evaluate their performance in numerical experiments.
arXiv comment38 pages
References in corpus (8)
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- Variance Reduction using Nonreversible Langevin Samplers
- Improving Asymptotic Variance of MCMC Estimators: Non-reversible Chains are Better
- Evaluating Partisan Gerrymandering in Wisconsin
- Improving the Asymptotic Performance of Markov Chain Monte-Carlo by Inserting Vortices
- Redistricting: Drawing the Line
- Redistricting and the Will of the People
- Nonreversible Langevin Samplers: Splitting Schemes, Analysis and Implementation