In this paper we consider Markov chains associated with the Metropolis-Hastings algorithm. We propose conditions under which the sequence of the successive densities of such a chain converges to the target density according to the total variation distance for any choice of the initial density. In particular we prove that the positiveness of the target and the proposal densities is enough for the chain to converge.
Comments: 14 Pages.
Unique-IP document downloads: 221 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.