Quantitative Non-Geometric Convergence Bounds for Independence Samplers

Methodology and Computing in Applied Probability

Volumn 13, Issue 2, 2011, Pages 391-403

  Roberts, Gareth O ^a   Rosenthal, Jeffrey S ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Convergence bounds; Independence sampler; Markov chain; MCMC

Indexed keywords

EID: 79954642392     PISSN: 13875841     EISSN: 15737713     Source Type: Journal    
DOI: 10.1007/s11009-009-9157-z     Document Type: Article

References (24)

1. Baxendale PH (2005) Renewal theory and computable convergence rates for geometrically ergodic Markov chains. Ann Appl Probab 15: 700-738.
2. Bingham NH, Goldie CM, Teugels JL (1987) Regular variation. Cambridge University Press, Cambridge.
3. Cowles MK, Rosenthal JS (1998) A simulation approach to convergence rates for Markov chain Monte Carlo algorithms. Stat Comput 8: 115-124.
4. Douc R, Moulines E, Rosenthal JS (2004) Quantitative bounds on convergence of time-inhomogeneous Markov chains. Ann Appl Probab 14: 1643-1665.
5. Douc R, Moulines E, Soulier P (2007) Computable convergence rates for sub-geometric ergodic Markov chains. Bernoulli 13: 831-848.
6. Fort G, Moulines E (2000) Computable bounds for subgeometrical and geometrical ergodicity. http://citeseer. ist. psu. edu/fort00computable. html.
7. Fort G, Moulines E (2003) Polynomial ergodicity of Markov transition kernels. Stoch Process Appl 103: 57-99.
8. Hastings WK (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57: 97-109.
9. Jarner SF, Roberts GO (2002) Polynomial convergence rates of Markov chains. Ann Appl Probab 12: 224-247.
10. Jones GL, Hobert JP (2001) Honest exploration of intractable probability distributions via Markov chain Monte Carlo. Stat Sci 16: 312-334.
11. Jones GL, Hobert JP (2004) Sufficient burn-in for Gibbs samplers for a hierarchical random effects model. Ann Stat 32: 784-817.
12. Liu J (1996) Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Stat Comput 6: 113-119.
13. Marchev D, Hobert JP (2004) Geometric ergodicity of van Dyk and Meng's algorithm for the multivariate Student's t model. J Am Stat Assoc 99: 228-238.
14. Mengersen KL, Tweedie RL (1996) Rates of convergence of the Hastings and Metropolis algorithms. Ann Stat 24: 101-121.
15. Meyn SP, Tweedie RL (1993) Markov chains and stochastic stability. Springer, London. http://probability. ca/MT/.
16. Roberts GO (1999) A note on acceptance rate criteria for CLTs for Metropolis-Hastings algorithms. J Appl Probab 36: 1210-1217.
17. Roberts GO, Rosenthal JS (1998) Markov chain Monte Carlo: some practical implications of theoretical results (with discussion). Can J Stat 26: 5-31.
18. Roberts GO, Rosenthal JS (2004) General state space Markov chains and MCMC algorithms. Probab Surv 1: 20-71.
19. Roberts GO, Tweedie RL (1996) Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83: 95-110.
20. Rosenthal JS (1995) Minorization conditions and convergence rates for Markov chain Monte Carlo. J Am Stat Assoc 90: 558-566.
21. Rosenthal JS (1997) Independence sampler Java applet. http://probability. ca/jeff/java/exp. html.
22. Rosenthal JS (2002) Quantitative convergence rates of Markov chains: a simple account. Electron Commun Probab 7: 123-128.
23. Tierney L (1994) Markov chains for exploring posterior distributions (with discussion). Ann Stat 22: 1701-1762.
24. Wolfram S (1988) Mathematica: a system for doing mathematics by computer. Addison-Wesley, New York.