Non-reversible Markov chain Monte Carlo for sampling of districting maps

Gregory Herschlag, Jonathan C. Mattingly, Matthias Sachs, Evan Wyse

Research output: Working paper/PreprintPreprint

28 Downloads (Pure)


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.
Original languageEnglish
Publication statusE-pub ahead of print - 18 Aug 2020

Bibliographical note

38 pages


  • stat.CO
  • math.PR
  • 60J10, 60J20, 62P99
  • G.3; G.2


Dive into the research topics of 'Non-reversible Markov chain Monte Carlo for sampling of districting maps'. Together they form a unique fingerprint.

Cite this