Efficiency and convergence properties of slice samplers

Scandinavian Journal of Statistics

Volumn 29, Issue 1, 2002, Pages 1-12

  Mira, Antonietta ^a   Tierney, Luke ^b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b NONE

Author keywords

Auxiliary variables; Efficiency of MCMC; Geometric ergodicity; Markov chain Monte Carlo; Metropolis Hastings algorithm; Peskun ordering; Uniform ergodicity

Indexed keywords

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

References (19)

1. Besag, J. & Green, P.J. (1993). Spatial statistics and Bayesian computation. J. Roy. Statist. Soc. Ser. B 55, 25-37.
2. Damien, P., Wakefield, J. & Walker, S. (1999). Gibbs sampling for Bayesian nonconjugate and hierarchical models using auxiliary variable. J. Roy. Statist. Soc. Ser. B 61, 331-344.
3. Edwards, R.G. & Sokal, A.D. (1988). Generalization of the Fortium-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Phys. Rev. D 38, 2009-2012.
4. Geyer, C.J. (1992). Practical Markov chain Monte Carlo. Statist. Sci. 7, 473-511.
5. Geyer, J.C. (1998). Markov chain Monte Carlo lecture notes. Unpublished.
6. Green, P.J. (1997). Contribution to the discussion of "the EM algorithm an old folk-song to a fast new tune" by X.L. Meng and D. van Dyk. J. Roy. Statist. Soc. Ser. B 59, 511-567.
7. Higdon, D.M. (1998). Auxiliary variable methods for Markov chain Monte Carlo with applications. J. Amer. Statist. Assoc. 93, 585-595.
8. Liu, J.S. (1991). Correlation structure and convergence rate of the Gibbs sampler. PhD thesis, University of Chicago.
9. Liu, J.S. (1996). Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Statist. Comput. 6, 113-119.
10. Liu, S.J., Wong, W.H. & Kong, A. (1995). Correlation structure and convergence rate of the Gibbs sampler with various scans. J. Roy. Statist. Soc. Ser. B 57, 157-169.
11. Matthews, P. (1993). A slowly mixing Markov chain with implications for the Gibbs sampler. Statist. Probab. Lett. 17, 231-236.
12. Mengersen, K.L. & Tweedie, R.L. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24, 101-121.
13. Mira, A. (1998). Ordering, slicing and splitting Monte Carlo Markov chains. PhD thesis, University of Minnesota. Available at http://aim.unipv.it/̃anto.
14. Peskun, P.H. (1973). Optimum Monte Carlo sampling using Markov chains. Biometrika 60, 607-612.
15. Roberts, G.O. & Rosenthal, J.S. (1997). Geometric ergodicity and hybrid Markov chains. Electron. Comm. Probab. 2, Paper 2.
16. Roberts, G.O. & Rosenthal, J.S. (1999). Convergence of slice sampler Markov chains. J. Roy. Statist. Soc. Ser. B 61, 643-660.
17. Swendsen, R.H. & Wang, J.S. (1987). Non-universal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 58, 86-88.
18. Tierney, L. (1994). Markov chains for exploring posterior distributions. Ann. Statist. 22, 1701-1762.
19. Tierney, L. (1998). A note on Metropolis-Hastings kernels for general state spaces. Ann. Appl. Probab. 8, 1-9.