Interacting Markov chain Monte Carlo methods for solving nonlinear measure-valued equations
Open Access
- 1 April 2010
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 20 (2) , 593-639
Abstract
We present a new class of interacting Markov chain Monte Carlo algorithms for solving numerically discrete-time measure-valued equations. The associated stochastic processes belong to the class of self-interacting Markov chains. In contrast to traditional Markov chains, their time evolutions depend on the occupation measure of their past values. This general methodology allows us to provide a natural way to sample from a sequence of target probability measures of increasing complexity. We develop an original theoretical analysis to analyze the behavior of these iterative algorithms which relies on measure-valued processes and semigroup techniques. We establish a variety of convergence results including exponential estimates and a uniform convergence theorem with respect to the number of target distributions. We also illustrate these algorithms in the context of Feynman–Kac distribution flows.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Sequentially interacting Markov chain Monte Carlo methodsThe Annals of Statistics, 2010
- A Functional Central Limit Theorem for a Class of Interacting Markov Chain Monte Carlo MethodsElectronic Journal of Probability, 2009
- Non-linear Markov Chain Monte CarloESAIM: Proceedings, 2007
- Equi-energy sampler with applications in statistical inference and statistical mechanicsThe Annals of Statistics, 2006
- Self-Interacting Markov ChainsStochastic Analysis and Applications, 2006
- Resolution Exchange Simulation with Incremental CoarseningJournal of Chemical Theory and Computation, 2006
- On convergence of chains with occupational self–interactionsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2004
- Monte Carlo Statistical Methods2004
- Sequential Monte Carlo Methods in Practice2001
- Rates of convergence of the Hastings and Metropolis algorithmsThe Annals of Statistics, 1996