arXiv · 1302.0654
On the convergence of the Metropolis-Hastings Markov chains
Abstract
In this paper we study Markov chains associated with the Metropolis-Hastings algorithm. We consider 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 proposal density is enough for the chain to converge. The content of this work basically presents a stand alone proof that the reversibility along with the kernel positivity imply the convergence.
Explore related subjects
Keep this discovery
Dimiter Tsvetkov, Lyubomir Hristov, Ralitsa Angelova-Slavova. 2013-02-04. On the convergence of the Metropolis-Hastings Markov chains. https://arxiv.org/abs/1302.0654
Cite the original work for its findings. Save a collection to share your selection of sources.