Exact sampling from anti-monotone systems

Statistica Neerlandica

Volumn 52, Issue 3, 1998, Pages 360-380

  Haggstrom O ^a   Nelander, K ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Hard core model; Markov chain monte carlo; Propp wilson algorithm; Random cluster model

Indexed keywords

EID: 0041181008     PISSN: 00390402     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9574.00090     Document Type: Article

References (30)

1. ASMUSSEN, S., P. W. GLYNN and H. THORISSON (1992), Stationary detection in the initial transient problem, ACM Transactions on Modeling and Computer Simulation 2, 130-157.
2. VAN DEN BERG, J. (1993), A uniqueness condition for Gibbs measures, with application to the 2-dimensional Ising antiferromagnet, Communications in Mathematical Physics 152, 161-166.
3. VAN DEN BERG, J. and J. STEIF (1994), Percolation and the hard core lattice gas model, Stochastic Processes and their Applications 49, 179-197.
4. FILL, J. A. (1997), An interruptible algorithm for perfect sampling via Markov chains, Annals of Applied Probability, to appear.
5. FORTUIN, C. M. and P. W. KASTELEYN (1972), On the random-cluster model. I. Introduction and relation to other models, Physica 57, 536-564.
6. GELMAN, A. and D. B. RUBIN (1992), Inference from iterative simulation using multiple sequences (with discussion), Statistical Science 7, 457-472 and 483-511.
7. GEMAN, S. and D. GEMAN (1984), Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence 6 721-741.
8. GEORGII, H-O. (1988), Gibbs measures and phase transitions, de Gruyter, New York.
9. GEYER, C. J. (1992), Practical Markov chain Monte Carlo (with discussion), Statistical Science 7, 473-511.
10. GILKS, W. R., S. RICHARDSON and D. J. SPIEGELHALTER (1996), Markov chain Monte Carlo in practice, Chapman and Hall, London.
11. GRIMMETT, G. (1989), Percolation, Springer, New York.
12. GRIMMETT, G. (1995), The stochastic random-cluster process, and the uniqueness of random-cluster measures, Annals of Probability 23, 1461-1510.
13. HÄGGSTRÖM, O. (1995), Random-cluster measures and uniform spanning trees, Stochastic Processes and their Applications 59, 267-275.
14. HÄGGSTRÖM, O. (1996), Random-cluster representations in the study of phase transitions, preprint.
15. HÄGGSTRÖM, O., M. N. M. VAN LIESHOUT and J. MØLLER (1997), Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes, Bernoulli, to appear.
16. KELLY, F. P. (1985), Stochastic models of computer communication systems, Journal of the Royal Statistical Society, Series B 47, 379-395.
17. KENDALL, W. (1996), Perfect simulation for the area-interaction point process, in: L. ACCARDI and C. HEYDE, (eds), Proceedings of the Symposium on Probability towards the year 2000, Springer, to appear.
18. KENDALL, W. and J. MØLLER (1997), Perfect Metropolis-Hastings simulation of locally stable spatial point processes, in preparation.
19. LIGGETT, T. M. (1985), Interacting particle systems, Springer, New York.
20. LINDVALL, T. (1992), Lectures on the coupling method, Wiley, New York.
21. LOVÁSZ, L. and P. WINKLER (1995), Exact mixing in an unknown Markov chain, Electronic Journal of Combinatorics 2, paper #R15.
22. METROPOLIS, N., A. W. ROSENBLUTH, M. N. ROSENBLUTH, A. H. TELLER and E. TELLER (1953), Equations of state calculations by fast computing machine, Journal of Chemical Physics 21, 1087-1091.
23. MURDOCH, D. J. and P. J. GREEN (1997), Exact sampling from a continuous state space, Scandinavian Journal of Statistics, to appear.
24. MØLLER, J. (1997), A note on perfect simulation of conditionally specified models, Journal of the Royal Statistical Society, Series B, to appear.
25. PEMANTLE, R. (1995), Uniform random spanning trees, Topics in contemporary probability and its applications (ed. J. L. SNELL), 1-54, CRC, Boca Raton.
26. PROPP, J. G. and D. B. WILSON (1996), Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures and Algorithms 9, 223-252.
27. PROPP, J. G. and D. B. WILSON (1997), How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph, Journal of Algorithms, to appear.
28. SEGERBERG, U. (1994), Generating uniform spanning trees from random walks, Master's thesis, Department of Mathematics, Chalmers University of Technology.
29. SWEENY, M. (1983), Monte Carlo study of weighted percolation clusters relevant to the Potts model, Physical Review B 27, 4445-4455.
30. WELSH, D. J. A. (1993), Percolation in the random cluster process and Q-state Potts model, Journal of Physics A: Mathematical and General 26, 2471-2483.