On Exact Simulation of Markov Random Fields Using Coupling from the Past

DOI10.1111/1467-9469.00156MaRDI QIDQ4956043zbMATH OpenOpenAlexFDO

Authors Olle Häggström, Karin Nelander

Publication date 24 May 2000

Published in Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1467-9469.00156

zbMATH Keywords

Markov chain Monte CarloMarkov random fieldsWidom-Rowlinson modelPropp-Wilson algorithmrandom \(q\)-colourings

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Random fields (60G60) Statistical mechanics of solids (82D20)

Recommendations

• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Exact Sampling from a Continuous State Space
• scientific article; zbMATH DE number 1559585

Cited in

(35)

• On mixing in pairwise Markov random fields with application to social networks
• Likelihood-based inference for Matérn type-III repulsive point processes
• A note on perfect simulation for exponential random graph models
• Sublinearity of the travel-time variance for dependent first-passage percolation
• Speeding up the FMMR perfect sampling algorithm: A case study revisited
• Exact distributed sampling
• Fast and perfect sampling of subgraphs and polymer systems
• Probability and algorithmics: a focus on some recent developments
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Fast perfect sampling from linear extensions
• Exact simulation for discrete time spin systems and unilateral fields
• Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration
• A random cluster algorithm for some continuous Markov random fields
• A Guide to Exact Simulation
• How to couple from the past using a read-once source of randomness
• Estimating the Granularity Coefficient of a Potts-Markov Random Field Within a Markov Chain Monte Carlo Algorithm
• Perfect simulation for marked point processes
• Improved bounds for perfect sampling of \(k\)-colorings in graphs
• Exact sampling with highly uniform point sets
• scientific article; zbMATH DE number 1526028 (Why is no real title available?)
• Doeblin trees
• scientific article; zbMATH DE number 1559585 (Why is no real title available?)
• Perfect sampling using bounding chains.
• Propp-Wilson algorithms and finitary codings for high noise Markov random fields
• An upper bound on the convergence time of the Gibbs sampler in Ising models
• Finitary codings for spatial mixing Markov random fields
• scientific article; zbMATH DE number 3942984 (Why is no real title available?)
• Binary Markov mesh models and symmetric Markov random fields: Some results on their equivalence
• scientific article; zbMATH DE number 1545677 (Why is no real title available?)
• scientific article; zbMATH DE number 1560251 (Why is no real title available?)
• Exact sampling from anti‐monotone systems
• The Wang-Landau algorithm reaches the flat histogram criterion in finite time
• scientific article; zbMATH DE number 3984244 (Why is no real title available?)
• Exact estimation for Markov chain equilibrium expectations
• Perfect simulation of steady-state Markov chain on mixed state space

This page was built for publication: On Exact Simulation of Markov Random Fields Using Coupling from the Past

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956043)