Displaying similar documents to “Convergence diagnosis to stationary distribution in MCMC methods via atoms and renewal sets”

The Kendall theorem and its application to the geometric ergodicity of Markov chains

Witold Bednorz (2013)

Applicationes Mathematicae

Similarity:

We give an improved quantitative version of the Kendall theorem. The Kendall theorem states that under mild conditions imposed on a probability distribution on the positive integers (i.e. a probability sequence) one can prove convergence of its renewal sequence. Due to the well-known property (the first entrance last exit decomposition) such results are of interest in the stability theory of time-homogeneous Markov chains. In particular this approach may be used to measure rates of convergence...

Bounds on regeneration times and limit theorems for subgeometric Markov chains

Randal Douc, Arnaud Guillin, Eric Moulines (2008)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

This paper studies limit theorems for Markov chains with general state space under conditions which imply subgeometric ergodicity. We obtain a central limit theorem and moderate deviation principles for additive not necessarily bounded functional of the Markov chains under drift and minorization conditions which are weaker than the Foster–Lyapunov conditions. The regeneration-split chain method and a precise control of the modulated moment of the hitting time to small sets are employed...

Hit and run as a unifying device

Hans C. Andersen, Persi Diaconis (2007)

Journal de la société française de statistique

Similarity:

We present a generalization of hit and run algorithms for Markov chain Monte Carlo problems that is ‘equivalent’ to data augmentation and auxiliary variables. These algorithms contain the Gibbs sampler and Swendsen-Wang block spin dynamics as special cases. The unification allows theorems, examples, and heuristics developed in one domain to illuminate parallel domains.