A central limit theorem for adaptive and interacting Markov chains

Details A central limit theorem for adaptive and interacting Markov chains A central limit theorem for adaptive and interacting Markov chains

2011-07-13

arxiv.org/abs/1107.2574v1

Mathematics

Statistics Theory

Scientific paper

Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general (non-Markovian) simulation framework covering both the adaptive and interacting MCMC algorithms. We establish a Central Limit Theorem for additive functionals of unbounded functions under a set of verifiable conditions, and identify the asymptotic variance. Our result extends all the results reported so far. An application to the interacting tempering algorithm (a simplified version of the equi-energy sampler) is presented to support our claims.

Affiliated with

Also associated with

No associations

Rating

A central limit theorem for adaptive and interacting Markov chains 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 A central limit theorem for adaptive and interacting Markov chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A central limit theorem for adaptive and interacting Markov chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-166115