Perfect sampling using bounding chains.

DOI10.1214/105051604000000080zbMath1052.60057arXivmath/0405284MaRDI 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 model; Monte Carlo Markov chains; coupling from the past; perfect simulation; mixing times; proper colorings; sink free orientation

Mathematics Subject Classification ID

60J22: Computational methods in Markov chains

65C05: Monte Carlo methods

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

65C40: Numerical analysis or methods applied to Markov chains

60J27: Continuous-time Markov processes on discrete state spaces

Related Items

An upper bound on the convergence time of the Gibbs sampler in Ising models, Fast perfect sampling from linear extensions, Exact Monte Carlo simulation for fork-join networks, Perfect sampling methods for random forests, Likelihood-based inference for Matérn type-III repulsive point processes

Cites Work

• Unnamed Item
• 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
• 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