Convergence of adaptive and interacting Markov chain Monte Carlo algorithms

Details Convergence of adaptive and interacting Markov chain Monte Carlo algorithms Convergence of adaptive and interacting Markov chain Monte Carlo algorithms

2012-03-14

arxiv.org/abs/1203.3036v1

Annals of Statistics 2011, Vol. 39, No. 6, 3262-3289

Mathematics

Statistics Theory

Published in at http://dx.doi.org/10.1214/11-AOS938 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of

Scientific paper

10.1214/11-AOS938

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 $\pi$ is sampled by using Markov transition kernels with a stationary distribution that differs from $\pi$.

Affiliated with

Also associated with

No associations

Rating

Convergence of adaptive and interacting Markov chain Monte Carlo algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence of adaptive and interacting Markov chain Monte Carlo algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence of adaptive and interacting Markov chain Monte Carlo algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-715531