On exact simulation of Markov random fields using coupling from the past

Scandinavian Journal of Statistics

Volumn 26, Issue 3, 1999, Pages 395-411

  Häggström, Olle ^a   Nelander, Karin ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b NONE

Author keywords

Markov chain Monte Carlo; Markov random fields; Propp Wilson algorithm; Random q colourings; Widom Rowlinson model

Indexed keywords

EID: 0033244550     PISSN: 03036898     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9469.00156     Document Type: Article

References (24)

1. Fill, J. A. (1998). An interruptible algorithm for perfect sampling via Markov chains. Ann. Appl. Probab. 8, 131-162.
2. Geman, S. & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intelligence 6, 721-741.
3. Georgii, H.-O. (1988). Gibbs measures and phase transitions. de Gruyter, New York.
4. Georgii, H.-O. & Häggström, O. (1996). Phase transition in continuum Potts models. Comm. Math. Phys. 181, 507-528.
5. Gilks, W. R., Richardson, S. & Spiegelhalter, D. J. (1996). Markov chain Monte Carlo in practice. Chapman & Hall, London.
6. Häggström, O. (1998). Random-cluster representations in the study of phase transitions. Markov Process. Related Fields 4, 275-321.
7. Häggström, O. & Nelander, K. (1998). Exact sampling from anti-monotone systems. Statist. Neerlandica 52, 360-380.
8. Häggström, O., van Lieshout, M. N. M. & Møller, J. (1999). Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes. Bernoulli 5(4), to appear.
9. Hjort, N. L. & Omre, H. (1994). Topics in spatial statistics (with discussion). Scand. J. Statist. 21, 289-357.
10. Jerrum, M. (1995). A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Structures Algorithms 7, 157-165.
11. Kelly, F. P. (1985). Stochastic models of computer communication systems. J. Roy. Statist. Soc. Ser. B 47, 379-395.
12. Kendall, W. (1998). Perfect simulation for the area-interaction point process, Probability towards 2000 (eds L. Accardi & C. Heyde). Lecture Notes in Statistics, 128. Springer, New York.
13. Kindermann, R. & Snell, J. L. (1980). Markov random fields and their applications. American Mathematical Society, Providence, RI.
14. Lebowitz, J. L. & Gallavotti, G. (1971). Phase transitions in binary lattice gases. J. Math. Phys. 12, 1129-1133.
15. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. & Teller, E. (1953). Equations of state calculations by fast computing machine. J. Chem. Phys. 21, 1087-1091.
16. Møller, J. (1999). A note on perfect simulation of conditionally specified models. J. Roy. Statist. Soc. Ser. B 61, 251-264.
17. Murdoch, D. J. & Green, P. J. (1998). Exact sampling from a continuous state space. Scand. J. Statist. 25, 483-502.
18. Propp, J. G. & Wilson, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures Algorithms 9, 223-252.
19. Propp, J. G. & Wilson, D. B. (1998). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms 27, 170-217.
20. Salas, J. & Sokal, A. D. (1997). Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Statist. Phys. 86, 551-579.
21. Tierney, L. (1994). Markov chains for exploring posterior distributions (with discussion). Ann. Statist. 22, 1701-1762.
22. Widom, B. & Rowlinson, J. S. (1970). New model for the study of liquid-vapor phase transition. J. Chem. Phys. 52, 1670-1684.
23. Williams, D. (1991). Probability with martingales. Cambridge University Press, Cambridge.
24. Winkler, G. (1995). Image analysis, random fields and dynamic Monte Carlo methods. A mathematical introduction. Springer, New York.