Perfect sampling using bounding chains.

DOI10.1214/105051604000000080zbMath1052.60057arXivmath/0405284OpenAlexW2028521956MaRDI QIDQ1879888

Mark L. Huber

Publication date: 15 September 2004

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0405284

zbMATH Keywords

Potts modelMonte Carlo Markov chainscoupling from the pastperfect simulationmixing timesproper coloringssink free orientation

Mathematics Subject Classification ID

Related Items (22)

Double Happiness: Enhancing the Coupled Gains of L-lag Coupling via Control Variates ⋮ Fast perfect sampling from linear extensions ⋮ Finitary coding for the sub-critical Ising model with finite expected coding volume ⋮ Perfect sampling from spatial mixing ⋮ Probability and algorithmics: a focus on some recent developments ⋮ Exact sampling for intractable probability distributions via a Bernoulli factory ⋮ Spatial birth-death swap chains ⋮ Perfect sampling methods for random forests ⋮ Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling ⋮ Likelihood-based inference for Matérn type-III repulsive point processes ⋮ Monotonic multigamma coupling for perfect sampling ⋮ Exact Monte Carlo simulation for fork-join networks ⋮ Using TPA to count linear extensions ⋮ Cutoff for General Spin Systems with Arbitrary Boundary Conditions ⋮ An upper bound on the convergence time of the Gibbs sampler in Ising models ⋮ Rank tests from partially ordered data using importance and MCMC sampling methods ⋮ Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlo ⋮ Random-cluster dynamics on random regular graphs in tree uniqueness ⋮ Finitary codings for spatial mixing Markov random fields ⋮ Dynamic Sampling from Graphical Models ⋮ Approximation algorithms for the normalizing constant of Gibbs distributions ⋮ Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random generation of combinatorial structures from a uniform distribution
• Loss networks
• Percolation and the hard-core lattice gas model
• Improved bounds for sampling colorings
• On Counting Independent Sets in Sparse Graphs
• Generating a random permutation with random transpositions
• Exact sampling from anti‐monotone systems
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• On Markov Chains for Independent Sets
• On Exact Simulation of Markov Random Fields Using Coupling from the Past
• Monte Carlo sampling methods using Markov chains and their applications
• Generating a random sink-free orientation in quadratic time

This page was built for publication: Perfect sampling using bounding chains.