Title of article
Parallel and interacting Markov chain Monte Carlo algorithm Original Research Article
Author/Authors
Fabien Campillo، نويسنده , , Rivo Rakotozafy، نويسنده , , Vivien Rossi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
10
From page
3424
To page
3433
Abstract
In many situations it is important to be able to propose N independent realizations of a given distribution law. We propose a strategy for making N parallel Monte Carlo Markov chains (MCMC) interact in order to get an approximation of an independent N-sample of a given target law. In this method each individual chain proposes candidates for all other chains. We prove that the set of interacting chains is itself a MCMC method for the product of N target measures. Compared to independent parallel chains this method is more time consuming, but we show through examples that it possesses many advantages. This approach is applied to a biomass evolution model.
Keywords
Markov chain Monte Carlo method , Interacting chains , Hidden Markov model
Journal title
Mathematics and Computers in Simulation
Serial Year
2009
Journal title
Mathematics and Computers in Simulation
Record number
854788
Link To Document