Markov chain Monte Carlo methods: Theory and practice

Handbook of Statistics

Volumn 43, Issue , 2020, Pages 1-66

  Spade, David A ^a  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

Bayesian statistics; Convergence; Lyapunov conditions; Metropolis Hastings; Mixing time

Indexed keywords

EID: 85083896134     PISSN: 01697161     EISSN: None     Source Type: Book Series    
DOI: 10.1016/bs.host.2019.06.001     Document Type: Chapter

References (59)

1. Barker, R.J., Link, W.A., Bayesian multimodel inference by RJMCMC: a Gibbs sampling approach. Am. Stat. 67:3 (2013), 150–156.
2. Bennett, J.E., Racine-Poon, A., Wakefield, J.C., MCMC for nonlinear hierarchical models. Gilks, W.R., Richardson, S., Spiegelhalter, D.J., (eds.) Markov Chain Monte Carlo in Practice, 1995, Chapman and Hall, London, 339–357.
3. Box, G.E.P., Jenkins, G.M., Reinsel, G.C., Time Series Analysis: Forecasting and Control. 1994, Prentice Hall, New York.
4. Carlin, B.P., Gelfand, A.E., An iterative Monte Carlo method for nonconjugate Bayesian analysis. Stat. Comput. 1 (1991), 119–128.
5. Chib, S., Nardari, F., Shephard, N., Markov chain Monte Carlo Methods for generalized stochastic volatility models. J. Econ. 108 (1998), 281–316.
6. Cowles, M.K., Carlin, B.P., Markov chain Monte Carlo convergence diagnostics: a comparative review. J. Am. Stat. Assoc. 91 (1996), 883–904.
7. Cowles, M.K., Rosenthal, J.S., A simulation-based approach to convergence rates for Markov chain Monte Carlo algorithms. Stat. Comput. 8 (1998), 115–124.
8. Dieter, U., Ahrens, J., Acceptance-rejection techniques for sampling from the gamma and beta distributions. 1974 Technical Report 83, Research. Office of Naval.
9. Fort, G., Moulines, E., Roberts, G.O., Rosenthal, J.S., On the geometric ergodicity of hybrid samplers. J. Appl. Probab. 40 (2003), 123–146.
10. Gelling, N., Schofield, M.R., Barker, R.J., RJMCMC: reversible jump MCMC using Post-Processing-R Package version 0.4.3. 2018 https://cran.r-project.org/web/packages/rjmcmc/rjmcmc.pdf.
11. Gelman, A., Rubin, D.B., Inference from iterative simulation using multiple sequences. Stat. Sci. 7 (1992), 457–511.
12. Gelman, A., Gilks, W.R., Roberts, G.O., Weak convergence and optimal scaling of random walk Metropolis algorithms. Ann. Appl. Probab. 7:1 (1997), 110–120.
13. Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A., Rubin, D.B., Bayesian Data Analysis. third ed., 2014, CRC Press, Taylor and Francis Group, Boca Raton, FL.
14. Geman, S., Geman, D., Stochastic relaxation, Gibbs distributions, and Bayesian restoration of images. IEEE Trans. Pattern Anal. Mach. Intell. 6 (1984), 721–741.
15. Geweke, J., Evaluating the accuracy of sampling-based approaches to calculating posterior moments. Bernardo, J.M., Berger, J., Dawid, A.P., Smith, A.F.M., (eds.) Bayesian Statistics 4, 1992, Oxford University Press, Oxford, UK, 169–193.
16. Gilks, W.R., Derivative-free adaptive rejection sampling for Gibbs sampling. Bernardo, J.M., Berger, J., Dawid, A.P., Smith, A.F.M., (eds.) Bayesian Statistics 4, 1992, Oxford University Press, Oxford, UK.
17. Gilks, W.R., Wild, P., Adaptive rejection sampling for Gibbs samplers. Appl. Stat. 41:2 (1992), 337–348.
18. Gilks, W.R., Richardson, S., Spiegelhalter, D.J., Markov Chain Monte Carlo in Practice. 1996, CRC Press, Taylor and Francis Group, Boca Raton, FL.
19. Green, P.J., Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika 82:4 (1995), 711–732.
20. Green, P.J., Hastie, D.I., Reversible jump MCMC. Genetics 155:3 (2009), 1391–1403.
21. Hastings, W., Monte Carlo sampling using Markov chains and their application. Biometrika 57 (1970), 97–109.
22. Heidelberger, P., Welch, P.D., Simulation run length control in the presence of an initial transient. Oper. Res. 31 (1983), 1109–1144.
23. Ishwaran, H., James, L.F., Sun, J., Bayesian model selection in finite mixtures by marginal density decompositions. J. Am. Stat. Assoc. 96 (2001), 1316–1332.
24. Jarner, S.F., Hansen, E., Geometric ergodicity of Metropolis algorithms. Stoch. Process. Appl. 85 (2000), 341–361.
25. Liang, F., Continuous contour Monte Carlo for marginal density estimation with an application to a spatial statistical model. J. Comput. Graph. Stat. 16:3 (2007), 608–632.
26. Metropolis, N., Rosenbluth, A., Rosenbluth, B., Teller, A., Teller, E., Equations of state calculations by fast computing machines. J. Chem. Phys., 21(6), 1953 1097-1092.
27. Meyn, S.P., Tweedie, R.L., Markov Chains and Stochastic Stability. second ed., 2005, Springer-Verlag, London.
28. Neal, R.M., Annealed importance sampling. 1998, University of Toronto Department of Statistics Technical Report.
29. Neal, R.M., Slice sampling. Ann. Stat. 31:3 (2003), 705–767.
30. Oh, M., Berger, J.O., Adaptive importance sampling in Monte Carlo integration. 1989, Purdue University Department of Statistics Technical Report.
31. Pan, J., Lee, M., Tsai, M., Reversible jump Markov chain Monte Carlo algorithm for Bayesian variable selection in logistic mixed models. Commun. Stat. Simul. Comput. 47:8 (2017), 2234–2247.
32. Perez Rodriguez, P., ars: adaptive rejection sampling-R package version 0.6. 2018 https://CRAN.R-project.org/package=ars.
33. Raftery, A.E., Lewis, S., How many iterations in the Gibbs sampler?. Bernardo, J.M., Berger, J., Dawid, A.P., Smith, A.F.M., (eds.) Bayesian Statistics 4, 1992, Oxford University Press, Oxford, U.K, 763–773.
34. Ripley, B.D., Stochastic Simulation. 1987, Wiley, New York.
35. Ritter, C., Tanner, M.A., Facilitating the Gibbs sampler: the Gibbs stopper and the Griddy-Gibbs sampler. J. Am. Stat. Assoc. 82 (1992), 861–868.
36. Roberts, G.O., Convergence diagnostics of the Gibbs sampler. Bernardo, J.M., Berger, J., Dawid, A.P., Smith, A.F.M., (eds.) Bayesian Statistics 4, 1992, Oxford University Press, Oxford, UK, 775–782.
37. 2 convergence of Markov Chain Monte Carlo. Berry, D., Chaloner, I., Geweke, J., (eds.) Bayesian Statistics and Econometrics: Essays in Honor of Arnold Zellner, 1996, North-Holland, Amsterdam, 373–384.
38. Roberts, G.O., Tweedie, R.L., Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83:1 (1996), 95–110.
39. Roberts, G.O., Gelman, A., Gilks, W.R., Weak convergence and optimal scaling of random-walk Metropolis algorithms. Ann. Appl. Probab. 7:10 (1997), 110–120.
40. Rosenthal, J.S., Minorization conditions and convergence rates for Markov chain Monte Carlo. J. Am. Stat. Assoc. 90 (1995), 558–566.
41. Rosenthal, J.S., Analysis of the Gibbs sampler for a model related to James-Stein estimators. Stat. Comput. 6 (1996), 269–275.
42. Schruben, L.W., Detecting initialization bias in simulation output. Oper. Res. 30 (1982), 569–590.
43. Schruben, L.W., Singh, H., Tierney, L., Optimal tests for initialization bias in simulation output. Oper. Res. 31 (1983), 1167–1178.
44. Sherlock, C., Fearnhead, P., Roberts, G.O., The random walk Metropolis: linking theory and practice through a case study. Stat. Sci. 25:2 (2010), 172–190.
45. Spade, D.A., A computational procedure for efficient estimation of the mixing time of a random-scan Metropolis algorithm. Stat. Comput. 26:4 (2016), 761–781.
46. Spade, D.A., Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths. Comput. Stat., 2020 (accepted).
47. Troughton, P.T., Godsill, S.J., A reversible jump sampler for autoregressive time series. Proceedings of the 1998 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1998.
48. Wei, G.C.G., Tanner, M.A., A Monte Carlo implementation of the EM algorithm and the poor man's data augmentation algorithms. J. Am. Stat. Assoc. 85 (1990), 699–704.
49. 1 Error. 1994, University of California at Berkeley Department of Statistics.
50. Yu, B., Mykland, P., Looking at Markov Samplers Through CUSUM Path Plots: A Simple Diagnostic Idea. 1994, University of California at Berkeley Department of Statistics.
51. Zeger, S., Karim, M.R., Generalized linear models with random effects: a Gibbs sampling approach. J. Am. Stat. Assoc. 86 (1991), 79–86.
52. Zellner, A., Min, C.K., Gibbs sampler convergence criteria. J. Am. Stat. Assoc. 90 (1995), 921–927.
53. Zhang, Z., Chan, K.L., Wu, Y., Chen, C., Learning a multivariate Gaussian model with the reversible jump MCMC algorithm. Stat. Comput. 14:4 (2014), 343–355.
54. Link, W.A., Barker, R.J., Bayesian Inference: With Ecological Applications. 2009, Academic Press.
55. Mengersen, K.L., Tweedie, R.L., Rates of convergence of the Hastings and Metropolis algorithms. Ann. Stat. 24:1 (1996), 101–121.
56. Robert, C.P., Casella, G., Monte Carlo Statistical Methods. second, 2004, Springer, New York.
57. Roberts, G.O., Rosenthal, J.S., Geometric ergodicity and hybrid Markov chains. Electron. Commun. Probab. 2 (1997), 13–25 Paper 2.
58. Roberts, G.O., Rosenthal, J.S., Two convergence properties of hybrid samplers. Ann. Appl. Probab. 8 (1998), 397–407.
59. Schervish, M.J., Carlin, B.P., On the convergence of successive substitution sampling. J. Comput. Graph. Stat. 1 (1992), 111–127.