A guide to exact simulation

International Statistical Review

Volumn 69, Issue 1, 2001, Pages 27-48

  Dimakos, Xeni K ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

Coupling from the past; Efficient sampling; Exact simulation; Fill's algorithm; Forward coupling; Ising model; MCMC

Indexed keywords

EID: 0035297747     PISSN: 03067734     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1751-5823.2001.tb00478.x     Document Type: Review

References (42)

1. Asmussen, S., Glynn, P.W. & Thorisson, H. (1992). Stationary detection in the initial transient problem. ACM Trans. Model. Comput., 2(2), 130-157.
2. Best, N., Cowles, M. & Vines, S. (1995). CODA Manual version 0.3. Cambridge, UK: MRC Biostatistics Unit.
3. Brooks, S. & Roberts, G. (1999). Assessing convergence of Markov chain Monte Carlo algorithms. Statist. Comput., 8, 319-335.
4. Corcoran, J.N. & Tweedie, R.L. (1998). Perfect sampling from independent Metropolis-Hastings chains. Preprint.
5. Cowles, M. & Carlin, B. (1996). Markov Chain Monte-Carlo convergence diagnostics: A comparative study. J. Amer. Statist. Assoc., 91, 883-904.
6. Doeblin, W. (1938). Exposé de la theorie des chaînes simples constantes de Markov à un nombre fini d'états. Rev. Math. Union Interbalkanique, 2, 77-105.
7. Fill, J.A. (1998). An interruptible algorithm for perfect sampling via Markov chains. Ann. Appl. Probab, 8, 131-162.
8. Fill, J.A., Machida, M., Murdoch, D.J. & Rosenthal, J.S. (1999). Extension of Fill's perfect rejection sampling algorithm to general chains. Preprint.
9. Fismen, M. (1998). Exact simulation using Markov chains. Technical Report 6/98. Department of Mathematical Sciences, Norwegian University of Technology. Diploma-thesis.
10. Frigessi, A. & Den Hollander, F. (1993). A dynamical phase transition in a caricature of a spin glass. J. Statist. Physics, 75, 585-625.
11. Geman, S. & Geman, D. (1984). Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Trans. Pattn. Anal. Mach. Intel., 6, 721-741.
12. Green. P.J. & Murdoch. D.J. (1999). Exact sampling for Bayesian inference: Towards general purpose algorithms. In Bayesian Statistics 6, Eds. J. Bernardo, J. Berger, A. Dawid & A. Smith, pp. 301-321. Oxford: Oxford University Press.
13. Hastings, W.K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57, 97-109.
14. Häggström, O. & Nelander, K. (1998). Exact sampling from anti-monotone systems. Statist. Neerlandica, 52, 360-380.
15. Häggström, O. & Nelander, K. (1999). On exact simulation of Markov random fields using coupling from the past. Scand. J. Statist, 26, 395-411.
16. 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, 641-658.
17. Johnson, V.E. (1996). Studying convergence of Markov chain Monte Carlo algorithms using coupled sample paths. J. Amer. Statist. Assoc., 91(433), 154-166.
18. Kendall, W.S. (1997). On some weighted Boolean models. In Advances in Theory and Applications of Random Sets, Ed. D. Jeulin, pp. 105-120. Singapore: World Scientific Publishing Company.
19. Kendall, W.S. (1998). Perfect simulation for the area-interaction point process. In Probability Towards 2000, Eds. C. Heyde & L. Accardi, pp. 218-234. New York: Springer-Verlag.
20. Kendall, W.S. & Møller, J. (2000). Perfect Metropolis-Hastings simulation of locally stable point processes. Advances in Applied Probability, 32, 844-865.
21. Kendall, W.S. & Thönnes, E. (1999). Perfect simulation in stochastic geometry. Pattern Recognition, 32(9), 1569-1586.
22. Lindvall, T. (1992). Lectures on the Coupling Method. London: John Wiley & Sons.
23. Lovász, L. & Winkler, P. (1995). Exact mixing in an unknown Markov chain. Electron. J. Combin., Paper #R15.
24. Mengersen. K., Robert. C. & Guihenneuc-Jouyaux. C. (1999). MCMC Convergence Diagnostics: "A Reviewww". In Bayesian Statistics 6, Eds. J. Bernardo, J. Berger, A. Dawid & A. Smith, pp. 415-440. Oxford: Oxford University Press.
25. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H. & Teller, E. (1953). Equations of state calculations by fast computing machine. J. Chem. Physics, 21, 1087-1091.
26. Meyn, S.P. & Tweedie, R.L. (1993). Markov chains and Stochastic Stability. London: Springer-Verlag.
27. Møller, J. (1999). Perfect simulation of conditionally specified models. J. Roy. Statist. Soc. Ser. B, 61(1), 251-264.
28. Møller, J. & Nicholls, G. (1999). Perfect sampling for sample-based inference. Preprint.
29. Møller, J. & Schladitz, K. (1999). Extensions of Fill's algorithm for perfect simulation. J. Roy. Statist. Soc. Ser. B, 61(4), 955-969.
30. Murdoch, D.J. & Green, P.J. (1998). Exact sampling from a continuous state space. Scand. J. Statist, 25(3), 483-502.
31. Murdoch, D.J. & Rosenthal, J.S. (2000). Efficient use of exact samples. Statistics and Computing, 10, 237-243.
32. Nelander, K. (1998). Contributions to Percolation Theory and Exact Sampling. PhD thesis. Chalmers University of Thechnology and Göteborg University.
33. Propp, J.G. & Wilson, D.B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures Algorithms, 9(1&2), 223-252.
34. Propp, J. & Wilson, D. (1998a). Coupling from the past: A user's guide. In Microsurveys in Discrete Probability, Eds. D. Aldous & J. Propp, Vol. 41, pp. 181-192 of DlMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.
35. Propp, J.G. & Wilson, D.B. (1998b). 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.
36. Raftery. A. & Lewis. S. (1992). How many iterations in the Gibbs sampler? In Bayesian Statistics 4, Eds. J. Bernardo, J. Berger, A. Dawid & A. Smith, pp. 765-776. Oxford: Oxford University Press.
37. Raftery. A. & Lewis. S. (1996). Implementing MCMC. In Markov chain Monte-Carlo in Practice, Eds. W. Gilks & D. Richardson and S.T. Spiegelhalter, pp. 115-130. London: Chapman and Hall.
38. Reutter, A. & Johnson, V. (1995). General strategies for assessing convergence of MCMC algorithms using coupled sample paths. Technical Report 95-25. Institute of Statistics and Decision Sciences, Duke University.
39. Ripley, B. (1987). Stochastic Simulation. New York: Wiley.
40. Thönnes, E. (1999). Perfect simulation of some point processes for the impatient user. Adv. in Appl. Probab, 31(1), 69-87.
41. Tierney, L. (1994). Markov Chains for Exploring Posterior Distributions (with discussion). Ann. Statist., 22, 1701-1762.
42. Winkler, G. (1995). Image Analysis, Random Fields and Dynamic Monte Carlo Methods. Berlin: Springer-Verlag.