DeepAI AI Chat
Log In Sign Up

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

by   Gregory Herschlag, et al.

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.


page 4

page 25

page 26


Note on the convergence time of some non-reversible Markov chain Monte Carlo methods

Introduced in statistical physics, non-reversible Markov chain Monte Car...

Reversible Genetically Modified Mode Jumping MCMC

In this paper, we introduce a reversible version of a genetically modifi...

Reversible and non-reversible Markov Chain Monte Carlo algorithms for reservoir simulation problems

We compare numerically the performance of reversible and non-reversible ...

Sex as Gibbs Sampling: a probability model of evolution

We show that evolutionary computation can be implemented as standard Mar...

Reversible Jump Metropolis Light Transport using Inverse Mappings

We study Markov Chain Monte Carlo (MCMC) methods operating in primary sa...

Transport Reversible Jump Proposals

Reversible jump Markov chain Monte Carlo (RJMCMC) proposals that achieve...

A general perspective on the Metropolis-Hastings kernel

Since its inception the Metropolis-Hastings kernel has been applied in s...