Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
Authors:
- G. FortGFG. Fort
- E. MoulinesEME. Moulines
- P. PriouretPPP. Priouret
Open Access
- 1 December 2011
- journal article
- research article
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 39 (6) , 3262-3289
Abstract
Adaptive and interacting Markov chain Monte Carlo algorithms (MCMC) have been recently introduced in the literature. These novel simulation algorithms are designed to increase the simulation efficiency to sample complex distributions. Motivated by some recently introduced algorithms (such as the adaptive Metropolis algorithm and the interacting tempering algorithm), we develop a general methodological and theoretical framework to establish both the convergence of the marginal distribution and a strong law of large numbers. This framework weakens the conditions introduced in the pioneering paper by Roberts and Rosenthal [J. Appl. Probab. 44 (2007) 458–475]. It also covers the case when the target distribution π is sampled by using Markov transition kernels with a stationary distribution that differs from π.Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- On nonlinear Markov chain Monte CarloBernoulli, 2011
- Sequentially interacting Markov chain Monte Carlo methodsThe Annals of Statistics, 2010
- A cautionary tale on the efficiency of some adaptive Monte Carlo schemesThe Annals of Applied Probability, 2010
- Aerosol model selection and uncertainty modelling by adaptive MCMC techniqueAtmospheric Chemistry and Physics, 2008
- A Note on Convergence of the Equi-Energy SamplerStochastic Analysis and Applications, 2008
- Non-linear Markov Chain Monte CarloESAIM: Proceedings, 2007
- Equi-energy sampler with applications in statistical inference and statistical mechanicsThe Annals of Statistics, 2006
- Renewal theory and computable convergence rates for geometrically ergodic Markov chainsThe Annals of Applied Probability, 2005
- Quantitative bounds on convergence of time-inhomogeneous Markov chainsThe Annals of Applied Probability, 2004
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithmsBiometrika, 1996