The data augmentation algorithm: Theory and methodology

Handbook of Markov Chain Monte Carlo

Volumn , Issue , 2011, Pages 253-294

  Hobert, James P ^a  

^a University of Florida ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84873662740     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (47)

1. Albert, J. H. and Chib, S. 1993. Bayesian analysis of binary and polychotomous response data. Journal of the American Statistical Association, 88:669-679
2. Chan, K. S. and Geyer, C. J. 1994. Comment on "Markov chains for exploring posterior distributions" by L. Tierney. Annals of Statistics, 22:1747-1758
3. Chen, M.-H. and Shao, Q.-M. 2000. Propriety of posterior distribution for dichotomous quantal response models. Proceedings of the American Mathematical Society, 129:293-302
4. Dempster, A. P., Laird, N. M., and Rubin, D. B. 1977. Maximum likelihood from incomplete data via the EM algorithm (with discussion). Journal of the Royal Statistical Society, Series B, 39:1-38
5. Diaconis, P. and Stroock, D. 1991. Geometric bounds for eigenvalues of Markov chains. Annals of Applied Probability, 1:36-61
6. Diaconis, P., Khare, K., and Saloff-Coste, L. 2008. Gibbs sampling, exponential families and orthogonal polynomials (with discussion). Statistical Science, 23:151-200
7. Eaton, M. L. 1989. Group Invariance Applications in Statistics. Institute of Mathematical Statistics, Hayward, CA, and American Statistical Association, Alexandria, VA
8. Fernández, C. and Steel, M. F. J. 1999. Multivariate Student-t regression models: Pitfalls and inference. Biometrika, 86:153-167
9. Fill, J. A., Machida, M., Murdoch, D. J., and Rosenthal, J. S. 2000. Extension of Fill's perfect rejection sampling algorithm to general chains. Random Structures and Algorithms, 17:290-316
10. Flegal, J. M., Haran, M., and Jones, G. L. 2008. Markov chain Monte Carlo: Can we trust the third significant figure? Statistical Science, 23:250-260
11. Geyer, C. J. 1992. Practical Markov chain Monte Carlo (with discussion). Statistical Science, 7:473-511
12. Hobert, J. P. and Marchev, D. 2008. A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms. Annals of Statistics, 36:532-554
13. Hobert, J. P. and Rosenthal, J. S. 2007. Norm comparisons for data augmentation. Advances and Applications in Statistics, 7:291-302
14. Hobert, J. P., Jones, G. L., Presnell, B., and Rosenthal, J. S. 2002. On the applicability of regenerative simulation in Markov chain Monte Carlo. Biometrika, 89:731-743
15. Hobert, J. P., Tan, A., and Liu, R. 2007. When is Eaton's Markov chain irreducible? Bernoulli, 13:641-652
16. Jones, G. L. and Hobert, J. P. 2001. Honest exploration of intractable probability distributions via Markov chain Monte Carlo. Statistical Science, 16:312-34
17. Jones, G. L., Haran, M., Caffo, B. S., and Neath, R. 2006. Fixed-width output analysis for Markov chain Monte Carlo. Journal of the American Statistical Association, 101:1537-1547
18. Liu, J. S. and Wu, Y. N. 1999. Parameter expansion for data augmentation. Journal of the American Statistical Association, 94:1264-1274
19. Liu, J. S., Wong, W. H., and Kong, A. 1994. Covariance structure of the Gibbs sampler with applications to comparisons of estimators and augmentation schemes. Biometrika, 81:27-40
20. Liu, J. S., Wong, W. H., and Kong, A. 1995. Covariance structure and convergence rate of the Gibbs sampler with various scans. Journal of the Royal Statistical Society, Series B, 57:157-169
21. Marchev, D. and Hobert, J. P. 2004. Geometric ergodicity of van Dyk and Meng's algorithm for the multivariate Student's t model. Journal of the American Statistical Association, 99:228-238
22. Meng, X.-L. and van Dyk, D. A. 1999. Seeking efficient data augmentation schemes via conditional and marginal augmentation. Biometrika, 86:301-320
23. Meyn, S. P. and Tweedie, R. L. 1993. Markov Chains and Stochastic Stability. Springer, London
24. Meyn, S. P. and Tweedie, R. L. 1994. Computable bounds for geometric convergence rates of Markov chains. Annals of Applied Probability, 4:981-1011
25. Mira, A. and Geyer, C. J. 1999. Ordering Monte Carlo Markov chains. Technical Report No. 632, School of Statistics, University of Minnesota
26. Mykland, P., Tierney, L., and Yu, B. 1995. Regeneration in Markov chain samplers. Journal of the American Statistical Association, 90:233-241
27. Neal, R. M. 2003. Slice sampling (with discussion). Annals of Statistics, 31:705-767
28. Nummelin, E. 1984. General Irreducible Markov Chains and Non-negative Operators. Cambridge University Press, Cambridge
29. R Development Core Team 2006. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria
30. Robert, C. P. 1995. Simulation of truncated normal variables. Statistics and Computing, 5:121-125
31. Roberts, G. and Smith, A. F. M. 1994. Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms. Stochastic Processes and Their Applications, 49:207-216
32. Roberts, G. O. and Rosenthal, J. S. 1997. Geometric ergodicity and hybrid Markov chains. Electronic Communications in Probability, 2:13-25
33. Roberts, G. O. and Rosenthal, J. S. 2001. Markov chains and de-initializing processes. Scandinavian Journal of Statistics, 28:489-504
34. Roberts, G. O. and Rosenthal, J. S. 2004. General state space Markov chains and MCMC algorithms. Probability Surveys, 1:20-71
35. Roberts, G. O. and Rosenthal, J. S. 2006. Harris recurrence of Metropolis-within-Gibbs and transdimensional Markov chains. Annals of Applied Probability, 16:2123-2139
36. Roberts, G. O. and Tweedie, R. L. 2001. Geometric L2 and L1 convergence are equivalent for reversible Markov chains. Journal of Applied Probability, 38A:37-41
37. Rosenthal, J. S. 1995. Minorization conditions and convergence rates for Markov chain Monte Carlo. Journal of the American Statistical Association, 90:558-566
38. Rosenthal, J. S. 2003. Asymptotic variance and convergence rates of nearly-periodic MCMC algorithms. Journal of the American Statistical Association, 98:169-177
39. Ross, S. M. 1996. Stochastic Processes, 2nd edn. Wiley, New York
40. Roy, V. and Hobert, J. P. 2007. Convergence rates and asymptotic standard errors for Markov chain Monte Carlo algorithms for Bayesian probit regression. Journal of the Royal Statistical Society, Series B, 69:607-623
41. Rudin, W. 1991. Functional Analysis, 2nd edn. McGraw-Hill, New York
42. Swendsen, R. H. and Wang, J.-S. 1987. Nonuniversal critical dynamics in Monte Carlo simulations. Physical Review Letters, 58:86-88
43. Tan, A. 2008. Analysis of Markov chain Monte Carlo algorithms for random effects models. PhD thesis, Department of Statistics, University of Florida
44. Tan, A. and Hobert, J. P. 2009. Block Gibbs sampling for Bayesian random effects models with improper priors: Convergence and regeneration. Journal of Computational and Graphical Statistics, 18:861-878
45. Tanner, M. A. and Wong, W. H. 1987. The calculation of posterior distributions by data augmentation (with discussion). Journal of the American Statistical Association, 82:528-550
46. Tierney, L. 1994. Markov chains for exploring posterior distributions (with discussion). Annals of Statistics, 22:1701-1762
47. van Dyk, D. A. and Meng, X.-L. 2001. The art of data augmentation (with discussion). Journal of Computational and Graphical Statistics, 10:1-50