Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T09:26:23.303Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  14 February 2001

OLLE HÄGGSTRÖM
Affiliation:
Department of Mathematics, Chalmers University of Technology, S-412 96 Gothenburg, Sweden (e-mail: olleh@math.chalmers.se, steif@math.chalmers.se)
JEFFREY E. STEIF
Affiliation:
Department of Mathematics, Chalmers University of Technology, S-412 96 Gothenburg, Sweden (e-mail: olleh@math.chalmers.se, steif@math.chalmers.se)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
2000 Cambridge University Press