Skip to Main content Skip to Navigation
Journal articles

Smoothness of Metropolis-Hastings algorithm and application to entropy estimation

Abstract : The transition kernel of the well-known Metropolis-Hastings (MH) algorithm has a point mass at the chain's current position, which prevent direct smoothness properties to be derived for the successive densities of marginals issued from this algorithm. We show here that under mild smoothness assumption on the MH algorithm "input" densities (the initial, proposal and target distributions), propagation of a Lipschitz condition for the iterative densities can be proved. This allows us to build a consistent nonparametric estimate of the entropy for these iterative densities. This theoretical study can be viewed as a building block for a more general MCMC evaluation tool grounded on such estimates.
Complete list of metadatas
Contributor : Didier Chauveau <>
Submitted on : Thursday, March 21, 2013 - 11:34:49 AM
Last modification on : Thursday, March 19, 2020 - 12:26:02 PM

Links full text



Didier Chauveau, Pierre Vandekerkhove. Smoothness of Metropolis-Hastings algorithm and application to entropy estimation. ESAIM: Probability and Statistics, EDP Sciences, 2012, 10.1051/ps/2012004. ⟨10.1051/ps/2012004⟩. ⟨hal-00803167⟩



Record views