Propp–Wilson Algorithms and Finitary Codings for High Noise Markov Random Fields
Olle Häggström, Jeffrey E. Steif · Combinatorics Probability Computing · 2000
In this paper, we combine two previous works, the first being by the first author and K. Nelander, and the second by J. van den Berg and the second author, to show (1) that one can carry out a Propp–Wilson exact simulation for all Markov random fields on ℤd satisfying a certain high noise assumption, and (2) that all such random fields are a finitary image of a finite state i.i.d. process. (2) is a strengthening of the previously known fact that such random fields are so-called Bernoulli shifts.