Perfect Sampling Using Bounding Chains

Abstract

Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimental bounds on the mixing time of the chain that are provably accurate and construction of perfect sampling algorithms when used in conjunction with protocols such as coupling from the past. Perfect sampling algorithms generate variates exactly from the target distribution without the need to know the mixing time of a Markov chain at all. We present here the basic theory and use of bounding chains for several chains from the literature, analyzing the running time when possible. We present bounding chains for the transposition chain on permutations, the hard core gas model, proper colorings of a graph, the antiferromagnetic Potts model and sink free orientations of a graph.

References in corpus (1)

• Perfect Sampling Using Bounding Chains

Cited by in corpus (21)

• Assessing significance in a Markov chain without mixing
• Perfect Sampling Using Bounding Chains
• A Survey on Epistemic (Model) Uncertainty in Supervised Learning: Recent Advances and Applications
• Approximation algorithms for the normalizing constant of Gibbs distributions
• Efficient Bayesian inference for exponential random graph models by correcting the pseudo-posterior distribution
• Exact sampling for intractable probability distributions via a Bernoulli factory
• Spatial birth-death swap chains
• A Faster Approximation Algorithm for the Gibbs Partition Function
• Random-cluster dynamics on random regular graphs in tree uniqueness
• Perfect sampling from spatial mixing
• Perfect Sampling for (Atomic) Lovász Local Lemma
• Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlo
• Perfect sampling of stochastic matching models with reneging
• Perfect Sampling of Markov Chains with Piecewise Homogeneous Events
• Fundamentals of Partial Rejection Sampling
• Double Happiness: Enhancing the Coupled Gains of L-lag Coupling via Control Variates
• Exact Simulation for Assemble-To-Order Systems
• Cutoff for general spin systems with arbitrary boundary conditions
• Designing Perfect Simulation Algorithms using Local Correctness
• Dynamic Sampling from Graphical Models
• Fewer colors for perfect simulation of proper colorings