final report - probability.ca

[JS03]
Jean, J. and A.N. Shiryaev. (2003). Limit Theorems for Stochastic Processes, 2nd ed. Springer-Verlag, New
York.
[Kal97] Kallenberg, O. (1997). Foundations of Modern Probability. Springer-Verlag, New York.
[KP99] Kloeden, P.E., and Platen, E. (1999). Numerical Solution of Stochastic Differential Equations, Applied
Mathematics, 23, Third corrected printing, Springer, New York.
[MPS11] Mattingly, J.C., Pillai, N.S., and Stuart, A.M. (2011). Diffusion Limits of Random Walk Metropolis
Algorithm in High Dimensions. Annals of Applied Probability, to appear.
[MRR+53] Metropolis, N, Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., and Teller, E. (1953). Equation of
state calculations by fast computing machines. The Journal of Chemical Physics, 21(6): 1087.
[MT09] Meyn, S., and Tweedie., R.L. (2009). Markov Chains and Stochastic Stability, Second Edition. Cambridge
University Press, NY.
[NR05] Neal, P., and Roberts, G.O. (2006). Optimal Scaling for Partially Updating MCMC Algorithms. Annals of
Applied Probability. 16(2), 475-515.
[NRY05] Neal, P., Roberts, G.O., and Yuen, W.K. (2007). Optimal Scaling of Random Walk Metropolis Algorithms
with Discontinuous Target Densities. Under revision for Annals of Applied Probability.
[PST11] Pillai, N.S., Stuart A.M., and Thiéry (2011). Optimal Scaling and Diffusion Limits for the Langevin
Algorithm in High Dimensions. Submitted to the Annals of Statistics.
[PG10] Pasarica, C. and Gelman, A. (2010). Adaptively Scaling the Metropolis Algorithm Using Expected Squared
Jumping Distance. Statistica Sinica, 20, 343-364.
[RC04] Robert, C. and Casella, G. (2004) Monte Carlo Statistical Methods, Second Edition. Springer, NY.
[RGG97] Roberts, G.O., Gelman, A., Gilks, W.R. (1997). Weak Convergence and Optimal Scaling of Random Walk
Metropolis Algorithms. Ann. Appl. Probab. 7, 110-20.
[RR98] Roberts, G.O., Rosenthal, J.S. (1998). Optimal Scaling of Discrete Approximations to Langevin Diffusions.
J.R. Stat. Soc. Ser. B Stat. Methodol. 60, 255-268.
[RR01] Roberts, G.O., Rosenthal, J.S. (2001). Optimal Scaling for various Metropolis-Hastings algorithms. Statis.
Sci. 16, 351-67.
[RR04] Roberts, G.O., Rosenthal, J.S. (2004). General State Space Markov Chains and MCMC Algorithms. Probab.
Surveys 1, 20-71.
[RT96] Roberts, G.O. and Tweedie, R.L. (1996). Exponential Convergence of Langevin Distributions and Their
Discrete Approximations. Bernoull, 2(4), 341-363.
[Ros08a] Rosenthal, J.S. (2008). Optimising Monte Carlo Search Strategies for Automated Pattern Detection.
[Ros08b] Rosenthal, J.S. (2008). Optimal Proposal Distributions and Adaptive MCMC. Prepared for MCMC Handbook.
[Ros10] Rosenthal, J.S. (2010). Optimal Proposal Distributions and Adaptive MCMC. Handbook of Markov Chain
Monte Carlo, S. Brooks, A. Gelman, G. Jones, and X.-L. Meng (editors), Chapman & Hall / CRC Press.
[SS05]
Shakarchi, R. and Stein, E.M. (2005). Real Analysis - Measure Theory, Integration and Hilbert Spaces,
Princeton University Press, Princeton.
[SK11] Shalizi, C.R. with Aryeh Kontorovich. (2011) Almost None of the Theory of Stochastic Processes,
Unpublished Manuscript. Available online http://www.stat.cmu.edu/~cshalizi/almost-none/v0.1.1/
almost-none.pdf
[Stro11] Stroock, D. (2011). Probability Theory - An Analytic View, Second Edition. Cambridge University Press,
New York.
[Tie94] Tierney, L. (1994). Markov chains for exploring posterior distributions (with discussion). Annals of Statistics.
22, 1701-1762.
50