A note on acceptance rate criteria for CLTs for Metropolis-Hastings algorithms

Journal of Applied Probability

Volumn 36, Issue 4, 1999, Pages 1210-1217

  Roberts, G O ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Central limit theorems; Hastings algorithms; Markov chain Monte Carlo; Metropolis algorithms

Indexed keywords

EID: 0033233847     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200017976     Document Type: Article

References (18)

1. BESAG, J. E., GREEN, P. J., HIGDON, D. AND MENGERSEN, K. L. (1995). Bayesian computation and stochastic systems (with discussion). Statist. Sci. 10, 3-66.
2. CHAN, K. S. AND GEYER, C. J. (1994). Discussion of [18]. Ann. Statist. 22, 1747-1758.
3. FELLER, W. (1971). An Introduction to Pprobability Theory and its Applications, Vol II, 2nd edn. Wiley, New York.
4. GILKS, W. R., RICHARDSON, S. AND SPIEGELHALTER, D. J. (1996). Markov Chain Monte Carlo in Practice. Chapman and Hall, London.
5. HASTINGS, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97-109.
6. KIPNIS, C. AND VARADHAN, S. R. S. (1986). Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions. Comm. Math. Phys. 104, 1-19.
7. LIU, J. S. (1997). Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Statistics and Computing. 6, 113-119.
8. MENGERSEN, K. L. AND TWEEDIE, R. L. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24, 101-121.
9. METROPOLIS, N., ROSENBLUTH, A., ROSENBLUTH, M., TELLER, A. AND TELLER, E. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1091.
10. ROBERTS, G. O. (1996). Markov chain concepts relating to sampling algorithms. In Markov Chain Monte Carlo in Practice. Chapman and Hall, London, pp. 45-58.
11. ROBERTS, G. O. AND ROSENTHAL, J. S. (1997). Geometric ergodicity and hybrid Markov chains. Electron. Commun. Prob. 2, 13-25.
12. ROBERTS, G. O. AND ROSENTHAL, J. S. (1998). Optimal scaling of discrete approximations to Langevin diffusions. University of Cambridge Statistical Laboratory research report 94-11. J. Roy. Statist. Assoc. B. 60, 255-268.
13. ROBERTS, G. O. AND SMITH, A. F. M. (1994). Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms. Stoch. Proc. Appl. 49, 207-216.
14. ROBERTS, G. O. AND TWEEDIE, R. L. (1996). Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83, 96-110.
15. ROBERTS, G. O. AND TWEEDIE, R. L. (1996). Exponential convergence of Langevin diffusions and their discrete approximations. Bernoulli 2, 341-363.
16. SMITH, A. F. M. AND ROBERTS, G. O. (1993). Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods (with discussion). J. Roy. Statist. Soc. B 55, 3-24.
17. SMITH, R. L. AND TIERNEY, L. (1996). Exact transition probabilities for the independence Metropolis sampler. University of Cambridge Statistical Laboratory research report 96-16.
18. TIERNEY, L. (1994). Markov chains for exploring posterior distributions (with discussion). Ann. Statist. 22, 1701-1762.