The Library
The random walk Metropolis : linking theory and practice through a case study
Tools
Sherlock, Chris, Fearnhead, Paul and Roberts, Gareth O. (2009) The random walk Metropolis : linking theory and practice through a case study. Working Paper. Coventry: University of Warwick. Centre for Research in Statistical Methodology. (Working papers).

PDF
WRAP_Sherlock_0916w.pdf  Published Version  Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader Download (854Kb) 
Official URL: http://www2.warwick.ac.uk/fac/sci/statistics/crism...
Abstract
The random walk Metropolis (RWM) is one of the most common Markov Chain Monte Carlo algorithms in practical use today. Its theoretical properties have been extensively explored for certain classes of target, and a number of results with important practical implications have been derived. This article draws together a selection of new and existing key results and concepts and describes their implications. The impact of each new idea on algorithm efficiency is demonstrated for the practical example of the Markov modulated Poisson process (MMPP). A reparameterisation of the MMPP which leads to a highly efficient RWM within Gibbs algorithm in certain circumstances is also developed.
Item Type:  Working or Discussion Paper (Working Paper) 

Subjects:  Q Science > QA Mathematics 
Divisions:  Faculty of Science > Statistics 
Library of Congress Subject Headings (LCSH):  Monte Carlo method, Markov processes, Random walks (Mathematics) 
Series Name:  Working papers 
Publisher:  University of Warwick. Centre for Research in Statistical Methodology 
Place of Publication:  Coventry 
Date:  2009 
Volume:  Vol.2009 
Number:  No.16 
Number of Pages:  48 
Status:  Not Peer Reviewed 
Access rights to Published version:  Open Access 
References:  Bai, Y., Roberts, G. O. and Rosenthal, J. S. (2009). On the containment condition for adaptive Markov chain Monte Carlo algorithms. Submitted Preprint. B´edard, M. (2007). Weak convergence of Metropolis algorithms for noni.i.d. target distributions. Ann. Appl. Probab. 17(4), 1222–1244. B´edard, M. (2008). Optimal acceptance rates for Metropolis algorithms: moving beyond 0.234. Stochastic Process. Appl. 118(12), 2198–2222. Burzykowski, T., Szubiakowski, J. and Ryden, T. (2003). Analysis of photon count data from singlemolecule fluorescence experiments. Chemical Physics 288, 291–307. Carlin, B. P. and Louis, T. A. (2009). Bayesian methods for data analysis. Texts in Statistical Science Series, CRC Press, Boca Raton, FL, 3rd edition. Dellaportas, P. and Roberts, G. O. (2003). An introduction to MCMC. In: Spatial Statistics and Computational Methods (ed. J. Moller), number 173 in Lecture Notes in Statistics, Springer, Berlin, 1–41. Fearnhead, P. and Sherlock, C. (2006). An exact Gibbs sampler for the Markov modulated Poisson processes. J. R. Stat. Soc. Ser. B Stat. Methodol. 68(5), 767–784. Gamerman, D. and Lopes, H. F. (2006). Markov chain Monte Carlo. Texts in Statistical Science Series, Chapman & Hall/CRC, Boca Raton, FL, 2nd edition, stochastic simulation for Bayesian inference. Geyer, C. J. (1992). Practical Markov chain Monte Carlo. Statistical Science 7, 473–483. Gilks, W. R., Richardson, S. and Spiegelhalter, D. J. (1996). Markov Chain Monte Carlo in practice. Chapman and Hall, London, UK. Haario, H., Saksman, E. and Tamminen, J. (2001). An adaptive metropolis algorithm. Bernoulli 7(2), 223–242. Jarner, S. F. and Roberts, G. O. (2002). Polynomial convergence rates of Markov chains. Ann. Appl. Probab. 12(1), 224–247. Kou, S. C., Xie, X. S. and Liu, J. S. (2005). Bayesian analysis of singlemolecule experimental data. Appl. Statist. 54, 1–28. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. and Teller, E. (1953). Equations of state calculations by fast computing machine. J. Chem. Phys. 21, 1087–1091. Meyn, S. P. and Tweedie, R. L. (1993). Markov chains and stochastic stability. Communications and Control Engineering Series, SpringerVerlag London Ltd., London. Neal, P. and Roberts, G. (2006). Optimal scaling for partially updating MCMC algorithm. Ann. Appl. Probab. 16, 475–515. Roberts, G. O. (2003). Linking theory and practice of MCMC. In: Highly structured stochas tic systems, volume 27 of Oxford Statist. Sci. Ser., Oxford Univ. Press, Oxford, 145–178, with part A by Christian P. Robert and part B by Arnoldo Frigessi. Roberts, G. O. and Rosenthal, J. S. (1997). Geometric ergodicity and hybrid Markov chains. Electron. Comm. Probab. 2, no. 2, 13–25 (electronic). Roberts, G. O. and Rosenthal, J. S. (2001). Optimal scaling for various MetropolisHastings algorithms. Statistical Science 16, 351–367. Roberts, G. O. and Rosenthal, J. S. (2007). Coupling and ergodicity of adaptive Markov chain Monte Carlo algorithms. J. Appl. Probab. 44(2), 458–475. Roberts, G. O. and Rosenthal, J. S. (2009). Examples of adaptive MCMC. J. Comp. Graph. Stat. To appear. Roberts, G. O., Gelman, A. and Gilks, W. R. (1997). Weak convergence and optimal scaling of random walk Metropolis algorithms. The Annals of Applied Probability 7, 110–120. Scott, S. L. and Smyth, P. (2003). The Markov modulated Poisson process and Markov Poisson cascade with applications to web traffic modelling. Bayesian Statistics 7, 1–10. Sherlock, C. (2005). In discussion of ’Bayesian analysis of singlemolecule experimental data’. Journal of the Royal Statistical Society, Series C 54, 500. Sherlock, C. (2006). Methodology for inference on the Markov modulated Poisson process and theory for optimal scaling of the random walk Metropolis. Ph.D. thesis, Lancaster University, available from http://eprints.lancs.ac.uk/850/. Sherlock, C. and Roberts, G. O. (2009). Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets. Bernoulli To appear. Sokal, A. (1997). Monte Carlo methods in statistical mechanics: foundations and new algorithms. In: Functional integration (Carg`ese, 1996), volume 361 of NATO Adv. Sci. Inst. Ser. B Phys., Plenum, New York, 131–192. 
URI:  http://wrap.warwick.ac.uk/id/eprint/35204 
Actions (login required)
View Item 