We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > The random walk Metropolis : linking theory and...
View graph of relations

« Back

The random walk Metropolis : linking theory and practice through a case study.

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>05/2010
<mark>Journal</mark>Statistical Science
Number of pages19
<mark>Original language</mark>English


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.