Propp–Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields

DOI10.1017/S0963548300004363zbMath0973.60049OpenAlexW2046174894MaRDI QIDQ2709847

Jeffrey E. Steif, Olle Häggström

Publication date: 18 November 2001

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300004363

zbMATH Keywords

Markov random fieldshigh noisefinitary codingsPropp-Wilson algorithms

Mathematics Subject Classification ID

Random fields (60G60) Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Related Items (15)

Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory ⋮ Finitary codings for the random-cluster model and other infinite-range monotone models ⋮ Perfect simulation for the infinite random cluster model, Ising and Potts models at low or high temperature ⋮ Finitary coding for the sub-critical Ising model with finite expected coding volume ⋮ Uniform even subgraphs and graphical representations of Ising as factors of i.i.d. ⋮ Sublinearity of the travel-time variance for dependent first-passage percolation ⋮ Random interlacement is a factor of i.i.d. ⋮ Developments in perfect simulation of Gibbs measures through a new result for the extinction of Galton-Watson-like processes ⋮ Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 ⋮ Spatial birth-death swap chains ⋮ Exact simulation for discrete time spin systems and unilateral fields ⋮ Perfect Simulation for Image Restoration ⋮ Exponential rates of convergence in the ergodic theorem: a constructive approach ⋮ Finitary codings for spatial mixing Markov random fields ⋮ Perfect simulation for interacting point processes, loss networks and Ising models.

This page was built for publication: Propp–Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields