Open Access
Translator Disclaimer
2013 Positivity of hit-and-run and related algorithms
Daniel Rudolf, Mario Ullrich
Author Affiliations +
Electron. Commun. Probab. 18: 1-8 (2013). DOI: 10.1214/ECP.v18-2507

Abstract

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 $MTM^*$, 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$.<br />

Citation

Download Citation

Daniel Rudolf. Mario Ullrich. "Positivity of hit-and-run and related algorithms." Electron. Commun. Probab. 18 1 - 8, 2013. https://doi.org/10.1214/ECP.v18-2507

Information

Accepted: 26 June 2013; Published: 2013
First available in Project Euclid: 7 June 2016

zbMATH: 1300.60081
MathSciNet: MR3078012
Digital Object Identifier: 10.1214/ECP.v18-2507

Subjects:
Primary: 60J05

JOURNAL ARTICLE
8 PAGES


SHARE
Back to Top