Skip to main content
Article thumbnail
Location of Repository

Positivity of hit-and-run and related algorithms

By Daniel Rudolf and Mario Ullrich


We prove positivity of the Markov operators that correspond to the hit-and-run algorithm, random scan Gibbs sampler, slice sampler and Metropolis algorithm with positive proposal. In particular, the results show that it is not necessary to consider the lazy versions of these Markov chains. The proof relies on a well known lemma which relates the positivity of the product MT M ∗ , for some operators M and T, to the positivity of T. It remains to find that kind of representation of the Markov operator with a positive operator T

Topics: Spectral gap, positivity, lazy, hit-and-run, Metropolis. AMS MSC 2010, 60J05
Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.