Skip to main content

Particle Markov chain Monte Carlo methods

Buy Article:

$43.00 plus tax (Refund Policy)

Summary. 

Markov chain Monte Carlo and sequential Monte Carlo methods have emerged as the two main tools to sample from high dimensional probability distributions. Although asymptotic convergence of Markov chain Monte Carlo algorithms is ensured under weak assumptions, the performance of these algorithms is unreliable when the proposal distributions that are used to explore the space are poorly chosen and/or if highly correlated variables are updated independently. We show here how it is possible to build efficient high dimensional proposal distributions by using sequential Monte Carlo methods. This allows us not only to improve over standard Markov chain Monte Carlo schemes but also to make Bayesian inference feasible for a large class of statistical models where this was not previously so. We demonstrate these algorithms on a non-linear state space model and a Lévy-driven stochastic volatility model.
No References
No Citations
No Supplementary Data
No Data/Media
No Metrics

Keywords: Bayesian inference; Markov chain Monte Carlo methods; Sequential Monte Carlo methods; State space models

Document Type: Research Article

Affiliations: 1: University of Bristol, UK 2: University of British Columbia, Vancouver, Canada, and Institute of Statistical Mathematics, Tokyo, Japan 3: University of British Columbia, Vancouver, Canada

Publication date: 2010-06-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more