Limit theorems for some adaptive MCMC algorithms with subgeometric kernels - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Bernoulli Année : 2010

Limit theorems for some adaptive MCMC algorithms with subgeometric kernels

Résumé

This paper deals with the ergodicity and the existence of a strong law of large numbers for adaptive Markov Chain Monte Carlo. We show that a diminishing adaptation assumption together with a drift condition for positive recurrence is enough to imply ergodicity. Strengthening the drift condition to a polynomial drift condition yields a strong law of large numbers for possibly unbounded functions. These results broaden considerably the class of adaptive MCMC algorithms for which rigorous analysis is now possible. As an example, we give a detailed analysis of the Adaptive Metropolis Algorithm of Haario et al. (2001) when the target distribution is sub-exponential in the tails.
Fichier principal
Vignette du fichier
AtchadeFort_publi_BEJ0807-17.pdf (422.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00300467 , version 1 (18-07-2008)
hal-00300467 , version 2 (03-09-2009)

Identifiants

Citer

Yves Atchadé, Gersende Fort. Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. Bernoulli, 2010, 16 (1), pp.116--154. ⟨hal-00300467v2⟩
108 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More