Perfect slice samplers

Journal of the Royal Statistical Society. Series B: Statistical Methodology

Volumn 63, Issue 3, 2001, Pages 593-606

  Mira, A ^a   Moller J ^c   Roberts, G O ^b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b LANCASTER UNIVERSITY   (United Kingdom)

^c NONE

Author keywords

Automodels; Auxiliary variables; Coupling from the past; Ising model; Perfect simulation; Random fields; Swendsen Wang algorithm

Indexed keywords

EID: 0035535705     PISSN: 13697412     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9868.00301     Document Type: Article

References (28)

1. Besag, J. (1974) Spatial interaction and the statistical analysis of lattice systems (with discussion). J. R. Statist. Soc. B, 36, 192-236.
2. Besag, J. and Green, P. J. (1993) Spatial statistics and Bayesian computation. J. R. Statist. Soc. B, 55, 25-37.
3. Borovkov, A. and Foss, S. (1992) Stochastically recursive sequences and their generalizations. Sib. Adv. Math., 2, 16-81.
4. Casella, G., Mengersen, K., Robert, C. and Titterington, D. (1999) Perfect slice samplers for mixtures of distributions. Technical Report. Biometrics Unit, Cornell University, Ithaca. (Available from http://www.maths. surrey.ac.uk/personal/st/S.Brooks/MCMC/.)
5. Cressie, N. (1991) Statistics for Spatial Data. New York: Wiley.
6. Damien, P., Wakefield, J. and Walker, S. (1999) Gibbs sampling for Bayesian non-conjugate and hierarchical models by using auxiliary variables. J. R. Statist. Soc. B, 61, 331-344.
7. Edwards, R. and Sokal, A. (1988) Generalization of the Fortium-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Phys. Rev. D, 38, 2009-2012.
8. Fill, J. (1998) An interruptible algorithm for perfect sampling via Markov chains. Ann. Appl. Probab., 8, 131-162.
9. Fismen, M. (1997) Exact sampling using Markov chains. Diploma Thesis. Department of Mathematical Sciences, Norwegian University of Technology and Science, Trondheim.
10. Foss, S., Tweedie, R. and Corcoran, J. (1998) Simulating the invariant measures of Markov chains using backward coupling at regeneration times. Probab. Engng Inform. Sci., 12, 303-320.
11. Green, P. and Murdoch, D. (1999) Exact sampling for Bayesian inference: towards general purpose algorithms. In Bayesian Statistics 6 (eds J. M. Bernardo, J. Berger, A. P. Dawid and A. F. M. Smith), pp. 301-321. Oxford: Oxford University Press.
12. Häggström, O., van Lieshout, M. and Møller, J. (1999) Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes. Bernoulli, 5, 641-659.
13. Kendall, W. (1997) Perfect simulation for spatial point process. In Proc. 51st Sess. International Statistical Institute, Istambul, vol. 3, pp. 163-166. The Hague: International Statistical Institute.
14. -(1998) Perfect simulation for the area-interaction point process. In Probability Towards 2000 (eds L. Accardi and C. Heyde), pp. 218-234. New York: Springer.
15. Kendall, W. S. and Møller, J. (2000) Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes. Adv. Appl. Probab., 32, 844-865.
16. Kendall, W. and Thönnes, E. (1999) Perfect simulation in stochastic geometry. J. Pattn Recogn, 32, 1569-1586.
17. Mira, A. and Tierney, L. (2001) Efficiency and convergence properties of slice samplers. Scand. J. Statist., to be published.
18. Møller, J. (1999) Perfect simulation of conditionally specified models. J. R. Statist. Soc. B, 61, 251-264.
19. Møller, J. and Nicholls, G. (1999) Perfect simulation for sample-based inference. Technical Report R-99-2011. Department of Mathematical Sciences, Aalborg University, Aalborg. (Available from http://www.maths. surrey.ac.uk/personal/st/S.Brooks/MCMC/.)
20. Møller, J. and Schladitz, K. (1999) Extensions of Fill's algorithm for perfect simulation. J. R. Statist. Soc. B, 61, 955-969.
21. Murdoch, D. and Green, P. (1998) Exact sampling from a continuous state space. Scand. J. Statist., 25, 483-502.
22. Propp, J. and Wilson, D. (1996) Exact sampling with coupled Markov chains and applications to statistical mechanics. Rand. Struct. Alg., 9, 223-252.
23. -(1998) How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Alg., 27, 170-217.
24. Roberts, G. and Rosenthal, J. S. (1999) Convergence of slice sampler Markov chains. J. R. Statist. Soc. B, 61, 643-660.
25. Roberts, G. and Smith, A. (1990) Simple conditions for the convergence of the Gibbs sampler and Hastings-Metropolis algorithms. Stock. Processes Applic., 49, 207-216.
26. Swendsen, R. and Wang, J. (1987) Non-universal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett., 58, 86-88.
27. Tierney, L. (1990) Lisp-Stat: an Object-oriented Environment for Statistical Computing and Dynamic Graphs. New York: Wiley.
28. Wilson, D. (2000) Layered multishift coupling for use in perfect sampling algorithms (with a primer on CFTP). Fields Inst. Communs, 26, 141-176.