Markov Chain Monte Carlo: 10 Years and Still Running!

Journal of the American Statistical Association

Volumn 95, Issue 452, 2000, Pages 1282-1286

  Cappé, Olivier ^a   Robert, Christian P ^b,c  

^a TELECOM PARISTECH   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c CREST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442325012     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.2000.10474330     Document Type: Article

References (36)

1. Best, N. G., Cowles, M. K., and Vines, K. (1995), “CODA: Convergence Diagnosis and Output Analysis Software for Gibbs Sampling Output, Version 0.30,” Technical report, MRC Biostatistics Unit, University of Cambridge.
2. Brooks, S. P., and Roberts, G. (1998), “Assessing Convergence of Markov Chain Monte Carlo Algorithms,” Statistics and Computing, 8, 319-335.
3. Clyde, M., Parmigiani, G., and Vidakovic, B. (1998), “Multiple Shrinkage and Subset Selection in Wavelets,” Biometrika, 85, 391-402.
4. Dey, D., Miiller, P., and Sinha, D. (1998), Practical Nonparametric and Semiparametric Bayesian Statistics, New York: Springer-Verlag.
5. Frigessi, A., Gasemyr, J., and Rue, H. (1999), “Antithetic Coupling of Two Gibbs Sampler Chains,” Annals of Statistics (to appear).
6. Gelfand, A. E., and Smith, A. F. M. (1990), “Sampling-Based Approaches to Calculating Marginal Densities,” Journal of the American Statistical Association, 85, 398-409.
7. Gelman, A., Gilks, W. R., and Roberts, G. O. (1996), “Efficient Metropolis Jumping Rules,” in Bayesian Statistics 5, eds. J. O. Berger, J. M. Bernardo, A. P. Dawid, D. V. Lindley, and A. F. M. Smith, London: Oxford University Press, pp. 599-608. Oxford
8. Gelman, A., and Rubin, D. B. (1992), “Inference From Iterative Simulation Using Multiple Sequences” (with discussion), Statistics of Science, 1, 457-511.
9. Geyer, C. J. (1992), “Practical Monte Carlo Markov Chain” (with discussion), Statistics of Science, 7, 473-511.
10. Gilks, W. R., Richardson, S., and Spiegelhalter, D. I. (1996), Markov Chain Monte Carlo in Practice, London: Chapman and Hall.
11. Giudici, P., and Green, P. J. (1999), “Decomposable Graphical Gaussian Model Determination,” Biometrika, 86, 785-801.
12. Godsill, S. J. (1997), “Bayesian Enhancement of Speech and Audio Signals Which can be Modeled as ARMA Processes,” International Statistical Review, 65, 1-21.
13. Green, P. J. (1995), “Reversible Jump MCMC Computation and Bayesian Model Determination,” Biometrika, 82, 711-732.
14. Green, P. J., and Murdoch, D. (1998), “Exact Sampling for Bayesian Inference: Towards General Purpose Algorithms,” in Bayesian Statistics 6, eds. J. O. Berger, J. M. Bernardo, A. P. Dawid, D. V. Lindley and A. F. M. Smith, London: Oxford University Press.
15. Grenander, U., and Miller, M. I. (1994), “Representation of Knowledge in Complex Systems” (with discussion), Journal of the Royal Statistical Society, 56, 549-603.
16. Hodgson, M. E. A. (1999), “A Bayesian restoration of an ion channel signal.” Journal of the Royal Statistical Society, 61, 95-114.
17. Holden, L. (1998), “Adaptive Chains,” Technical Report SAND/11/98, Norwegian Computing Center, Olso.
18. Key, J., Perrichi, L., and Smith, A. F. M. (1999), “Bayesian Model Choice: What and Why?,” in Bayesian Statistics 6, eds. J. O. Berger, J. M. Bernardo, A. P. Dawid, and A. F. M. Smith, London: Oxford University Press.
19. Kim, S., Shephard, N., and Chib, S. (1998), “Stochastic Volatility: Likelihood Inference and Comparison With ARCH Models,” Review of Economic Studies, 65, 361-394.
20. Liu, J. S., and Chen, R. (1998), “Sequential Monte Carlo Methods for Dynamic Systems,” Journal of the American Statistical Association, 93, 1032-1044.
21. Liu, J. S., and Sabati, C. (1999), “Simulated Sintering: Markov Chain Monte Carlo With Spaces of Varying Dimensions,” in Bayesian Statistics 6, eds. J. O. Berger, J. M. Bernardo, A. P. Dawid, and A. F. M. Smith, London: Oxford University Press.
22. Madigan, D., and York, J. (1995), “Bayesian Graphical Models for Discrete Data,” International Statistical Review, 63, 215-232.
23. Mau, B., and Newton, M. A. (1997), “Phylogenetic Inference on Dendo-grams Using Markov Chain Monte Carlo Methods,” Journal of Computing and Graphical Statistics, 6, 122-131.
24. Mengersen, K. L., and Tweedie, R. L. (1996), “Rates of Convergence of the Hastings and Metropolis Algorithms,” The Annals of Statistics, 24, 101-121.
25. Mira, A., Møller, J., and Roberts, G. O. (1999), “Perfect Slice Samplers,” technical report, Università Degli Studi dell’Insurbia, Varese.
26. Neal, R. M. (1996a), Bayesian Learning for Neural Networks, New York: Springer-Verlag.
27. Neal, R. M. (1996b), “Sampling From Multimodal Distributions Using Tempered Transitions,” Statistics and Computing, 4, 353-366.
28. Pitt, M. K., and Shephard, N. (1999), “Filtering via Simulation: Auxiliary Particle Filter,” Journal of the American Statistical Association, 94, 590-599.
29. Propp, J. G., and Wilson, D. B. (1996), “Exact Sampling With Coupled Markov Chains and Applications to Statistical Mechanics,” Random Structures and Algorithms, 9, 223-252.
30. Robert, C. P. (1998), “MCMC Specifics for Latent Variable Models,” in COMPSTAT1998, eds. R. Payne and P. J. Green, Heidelberg: Physica-Verlag. pp. 101-112.
31. Robert, C. P., and Casella, G. (1999), Monte Carlo Statistical Methods, New York: Springer-Verlag.
32. Roberts, G. O., and Rosenthal, J. S. (1998), “Optimal Scaling of Discrete Approximations to Langevin Diffusions,” Journal of the Royal Statistical Society, Ser. B, 60, 255-268.
33. Roberts, G. O., and Rosenthal, J. S. (1999), “Convergence of Slice Sampler Markov Chains,” Journal of the Royal Statistical Society, Ser. B, 61, 643-660.
34. Roberts, G. O., and Tweedie, R. (1999), “Bounds on Regeneration Times and Convergence Rates for Markov Chains,” Stochastic Proceedings and Applications, 80, 211-229.
35. Rosenthal, J. S. (1995), “Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo,” Journal of the American Statistical Association, 90, 558-566.
36. Stevens, M. (2000), “Bayesian Analysis of Mixtures With an Unknown Number of Components-An Alternative to Reversible Jump Methods,” The Annals of Statistics, 28, 40-74.