Plummer, Martyn et al. (Mar. 2006). “CODA: convergence diagnosis and output analysis for MCMC”. R News 6.1, pp. 7–11. R Core Team, ., ed. (2014). R: A Language and Environment for Statistical Computing . Vienna, Austria: R Foundation for Statistical Computing. Robert, Christian P and George Casella (2004). Monte Carlo statistical methods . Vol. 319. Citeseer. Roberts, G. O., A. Gelman, and W. R. Gilks (Feb. 1997). “Weak convergence and optimal scaling of random walk Metropolis algorithms”. The Annals of Applied Probability 7.1. MR: MR1428751 Zbl: 0876.60015, pp. 110–120. Roberts, G. O. and S. K. Sahu (Jan. 1, 1997). “Updating Schemes, Correlation Structure, Blocking and Parameterization for the Gibbs Sampler”. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 59.2, pp. 291–317. Roberts, G. O. and R. L. Tweedie (Mar. 1, 1996). “Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms”. Biometrika 83.1, pp. 95–110. Roberts, Gareth O. and Jeffrey S. Rosenthal (Nov. 2001). “Optimal scaling for various Metropolis- Hastings algorithms”. Statistical Science 16.4. MR: MR1888450 Zbl: 02068937, pp. 351–367. — (Jan. 1, 2009). “Examples of Adaptive MCMC”. Journal of Computational and Graphical Statis- tics 18.2, pp. 349–367. Rue, Havard and Leonhard Held (Feb. 18, 2005). Gaussian Markov Random Fields: Theory and Applications . CRC Press. 281 pp. Sargent, Daniel J., James S. Hodges, and Bradley P. Carlin (June 1, 2000). “Structured Markov Chain Monte Carlo”. Journal of Computational and Graphical Statistics 9.2, pp. 217–234. Shaby, B. and M. Wells (2011). Exploring an adaptive Metropolis algorithm . 2011-14. Department of Statistics, Duke University. Skaug, Hans J. and David A. Fournier (Nov. 15, 2006). “Automatic approximation of the marginal likelihood in non-Gaussian hierarchical models”. Computational Statistics & Data Analysis 51.2, pp. 699–709. Stan Development Team, . (2014). “Stan: A C++ Library for Probability and Sampling, Version 2.5.0”. 32