Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-24T05:31:04.050Z Has data issue: false hasContentIssue false
  • English
  • Français

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  and
JEFFREY E. STEIF
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)
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 9 , Issue 5 , September 2000 , pp. 425 - 439
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)