Honest exploration of intractable probability distributions via markov chain monte carlo

Statistical Science

Volumn 16, Issue 4, 2001, Pages 312-334

  Jones, Galin L ^a   Hobert, James P ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b University of Florida ^*  (United States)

Author keywords

Central limit theorem; Convergence rate; Coupling inequality; Drift condition; General state space; Geometric ergodicity; Gibbs sampler; Hierarchical random effects model; Metropolis algorithm; Minorization condition; Regeneration; Splitting; Uniform ergodicity

Indexed keywords

EID: 0000154395     PISSN: 08834237     EISSN: None     Source Type: Journal    
DOI: 10.1214/ss/1015346317     Document Type: Article

References (65)

1. Athreya, K. B. and Ney, P. (1978). A new approach to the limit theory of recurrent Markov chains. Trans. Amer. Math. Soc. 245 493-501.
2. Besag, J., Green, P., Higdon, D. and Mengersen, K. (1995). Bayesian computation and stochastic systems (with discussion). Statist. Sci. 10 3-66.
3. Billera, L. J. and Diaconis, P. (2001). A geometric interpretation of the Metropolis algorithm. Statist. Sci. 16 335-339.
4. Bratley, p., Fox, B. L. and SCHRAGE, L. E. (1987). A Guide to Simulation. Springer, New York.
5. Caffo, B. S., Booth, J. G. and Davison, A. C. (2001). Empirical sup rejection sampling, Technical report, Univ. Florida.
6. Chan, K. S. and Geyer, C. J. (1994). Comment on “Markov chains for exploring posterior distributions.” Ann. Statist. 22 1747-1758.
7. Chib, S. and Greenberg, E. (1995). Understanding the Metropolis-Hastings algorithm. Amer. Statist. 49 327-335.
8. Cowles, M. K. and Rosenthal, J. S. (1998). A simulation approach to convergence rates for Markov chain Monte Carlo algorithms. Statist. Comput. 8 115-124.
9. Crane, M. A. and Iglehart, D. L. (1975). Simulating stable stochastic systems III: Regenerative processes and discrete-event simulations. Oper. Res. 23 33-45.
10. Diaconis, P. and STROOCK, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36-61.
11. Diaconis, P. and Sturmfels, B. (1998). Algebraic algorithms for sampling from conditional distributions. Ann. Statist. 26 363-397.
12. Frigessi, a., di Stefano, p., Hwang, C.-R. and Sheu, S.-J. (1993). Convergence rates of the Gibbs sampler, the Metropolis algorithm and other single-site updating dynamics. J. Roy. Statist. Soc. Ser. B 55 205-219.
13. Gelfand, A. E., Hills, S. E., Racine-Poon, A. and Smith, A. F. M. (1990). Illustration of Bayesian inference in normal data models using Gibbs sampling. J. Amer. Statist. Assoc. 85 972-985.
14. Gelfand, A. E. and Smith, A. F. M. (1990). Sampling-based approaches to calculating marginal densities. J. Amer. Statist. Assoc. 85 398-409.
15. Geyer, C. J. (1992). Practical Markov chain Monte Carlo (with discussion). Statist. Sci. 7 473-511.
16. Geyer, C. J. and Thompson, E. A. (1995). Annealing Markov chain Monte Carlo with applications to ancestral inference. J. Amer. Statist. Assoc. 90 909-920.
17. Gilks, W. R., Richardson, S. and Spiegelhalter, D. J. E. (1996). Markov Chain Monte Carlo in Practice. Chapman and Hall, London.
18. Gilks, W. R., Roberts, G. O. and Sahu, S. K. (1998). Adaptive Markov chain Monte Carlo through regeneration. J. Amer. Statist. Assoc. 93 1045-1054.
19. Glynn, P. W. (1985). Regenerative structure of Markov chains simulated via common random numbers. Oper. Res. Lett. 4 49-53.
20. Glynn, P. W. and Iglehart, D. L. (1987). A joint central limit theorem for the sample mean and regenerative variance estimator. Ann. Oper. Res. 8 41-55.
21. Glynn, P. W. and Iglehart, D. L. (1990). Simulation output analysis using standardized time series. Math. Oper. Res. 15 1-16.
22. Guihenneuc-Jouyaux, C. and Robert, C. P. (1998). Discretization of continuous Markov chains and Markov chain Monte Carlo convergence assessment. J. Amer. Statist. Assoc. 93 1055-1067.
23. HOBERT, J. P. (2001). Discussion of “The art of data augmentation.” J. Comput. Graph. Statist. 10 59-68.
24. HOBERT, J. P. and Geyer, C. J. (1998). Geometric ergodicity of Gibbs and block Gibbs samplers for a hierarchical random effects model. J. Multivariate Anal. 67 414-430.
25. Hobert, J. p., Jones, G. L., Presnell, B. and Rosenthal, J. S. (2001). On the applicability of regenerative simulation in Markov chain Monte Carlo. Technical report, Univ. Florida.
26. INGRASSiA, S. (1994). On the rate of convergence of the Metropolis algorithm and Gibbs sampler by geometric bounds. Ann. Appl. Probab. 4 347-389.
27. JARNER, S. F. and HANSEN, E. (2000). Geometric ergodicity of Metropolis algorithms. Stochastic Process. Appl. 85 341-361.
28. JARNER, S. F. and ROBERTS, G. O. (2001). Polynomial convergence rates of Markov chains. Ann. Appl. Probab. To appear.
29. JONES, G. L. and HOBERT, J. P. (2001). Upper bounds on the distance to stationarity for the block Gibbs sampler for a hierarchical random effects model. Technical report, Univ. Florida.
30. LEVINE, R. A. and Casella, G. (2001). Implementations of the Monte Carlo EM algorithm. J. Comput. Graph. Statist. 10 422-439.
31. Lindvall, T. (1992). Lectures on the Coupling Method. Wiley-Interscience, New York.
32. Liu, J. S., Wong, W. H. and KONG, A. (1994). Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes. Biometrika 81 27-40.
33. Lund, R. B. and Tweedie, R. L. (1996). Geometric convergence rates for stochastically ordered Markov chains. Math. Oper. Res. 20 182-194.
34. Lyles, R. H., Kupper, L. L. and Rappaport, S. M. (1997). Assessing regulatory compliance of occupational exposures via the balanced one-way random effects ANOVA model. J. Agricultural Biol. Environ. Statist. 2 64-86.
35. McCULLOCH, C. E. (1997). Maximum likelihood algorithms for generalized linear mixed models. J. Amer. Statist. Assoc. 92 162-170.
36. MENGERSEN, K. and Tweedie, R. L. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24 101-121.
37. Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London.
38. Meyn, S. P. and Tweedie, R. L. (1994). Computable bounds for geometric convergence rates of Markov chains. Ann. Appl. Probab. 4 981-1011.
39. Mira, A. and Tierney, L. (2001). On the use of auxiliary variables in Markov chain Monte Carlo sampling. Scand. J. Statist. To appear.
40. Mykland, P., Tierney, L. and Yu, B. (1995). Regeneration in Markov chain samplers. J. Amer. Statist. Assoc. 90 233-241.
41. NATARAJAN, R. and McCuLLOCH, C. E. (1998). Gibbs sampling with diffuse proper priors: A valid approach to data-driven inference? J. Comput. Graph. Statist. 7 267-277.
42. Nummelin, E. (1978). A splitting technique for Harris recurrent Markov chains. Z. Wahrsch. Verw. Gebiete 43 309-318.
43. Nummelin, E. (1984). General Irreducible Markov Chains and Non-negative Operators. Cambridge Univ. Press.
44. Ripley, B. D. (1987). Stochastic Simulation. Wiley, New York.
45. ROBERT, C. P. (1995). Convergence control methods for Markov chain Monte Carlo algorithms. Statist. Sci. 10 231-253.
46. ROBERT, C. P. and Casella, G. (1999). Monte Carlo Statistical Methods. Springer, New York.
47. ROBERTS, G. O. (1999). A note on acceptance rate criteria for CLTs for Metropolis-Hastings algorithms. J. Appl. Probab. 36 1210-1217.
48. Roberts, G. O. and Rosenthal, J. S. (1998a). Markov chain Monte Carlo: Some practical implications of theoretical results (with discussion). Canad. J. Statist. 26 5-31.
49. Roberts, G. O. and Rosenthal, J. S. (1998b). On convergence rates of Gibbs samplers for uniform distributions. Ann. Appl. Probab. 8 1291-1302.
50. Roberts, G. O. and Rosenthal, J. S. (1999). Convergence of slice sampler Markov chains. J. Roy. Statist. Soc. Ser. B 61 643-660.
51. Roberts, G. O. and Sahu, S. K. (1997). Updating schemes, correlation structure, blocking and parameterization for the Gibbs sampler. J. Roy. Statist. Soc. Ser. B 59 291-317.
52. Roberts, G. O. and Tweedie, R. L. (1996). Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83 95-110.
53. Roberts, G. O. and Tweedie, R. L. (1999). Bounds on regeneration times and convergence rates for Markov chains. Stochastic Process. Appl. 80 211-229.
54. Roberts, G. O. and Tweedie, R. L. (2001). Bounds on regeneration times and convergence rates for Markov chains. (Corrigendum). Stochastic Process. Appl. 91 337-338.
55. RoSENTHAL, J. S. (1995). Minorization conditions and convergence rates for Markov chain Monte Carlo. J. Amer. Statist. Assoc. 90 558-566.
56. RoSENTHAL, J. S. (1996). Analysis of the Gibbs sampler for a model related to James-Stein estimators. Statist. Comput. 6 269-275.
57. RoSENTHAL, J. S. (2001). A review of asymptotic convergence for general state space Markov chains. Far East J. Theoret. Statist. 5 37-50.
58. Schmeiser, B. (1982). Batch size effects in the analysis of simulation output. Oper. Res. 30 556-568.
59. Searle, S. R., Casella, G. and McCulloch, C. E. (1992). Variance Componenets. Wiley, New York.
60. Spiegelhalter, D. J., Thomas, A. and Best, N. G. (1999). Win-BUGS Version 1.2, MRC Biostatistics Unit, Cambridge, UK.
61. Tanner, M. A. and Wong, W. H. (1987). The calculation of posterior distributions by data augmentation (with discussion). J Amer. Statist. Assoc. 82 528-550.
62. Tierney, L. (1994). Markov chains for exploring posterior distributions (with discussion). Ann. Statist. 22 1701-1762.
63. Tierney, L. (1998). A note on Metropolis-Hastings kernels for general state spaces. Ann. Appl. Probab. 8 1-9.
64. van Dyk, D. A. and Meng, X.-L. (2001). The art of data augmentation (with discussion). J. Comput. Graph. Statist. 10 1-111.
65. n. Stochastic Process. Appl. 87 1-23.