Algorithmes EM et SEM pour un mélange censuré de distributions de défaillances. Application à la fiabilité d'équipements électroniques en période de jeunesse
Smoothness of Metropolis-Hastings algorithm and application to entropy estimation
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...
Page 1