Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T22:36:34.274Z Has data issue: false hasContentIssue false

Comparison of hit-and-run, slice sampler and random walk Metropolis

Published online by Cambridge University Press:  16 January 2019

Daniel Rudolf*
Affiliation:
Universität Göttingen
Mario Ullrich*
Affiliation:
Universität Linz
*
* Postal address: Felix-Bernstein-Institute for Mathematical Statistics in the Biosciences, Universität Göttingen, Goldschmidstraße 7, 37077 Göttingen, Germany. Email address: daniel.rudolf@uni-goettingen.de
** Postal address: Universität Linz, Altenberger Straße 69, 4040 Linz, Austria. Email address: mario.ullrich@jku.at
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Different Markov chains can be used for approximate sampling of a distribution given by an unnormalized density function with respect to the Lebesgue measure. The hit-and-run, (hybrid) slice sampler, and random walk Metropolis algorithm are popular tools to simulate such Markov chains. We develop a general approach to compare the efficiency of these sampling procedures by the use of a partial ordering of their Markov operators, the covariance ordering. In particular, we show that the hit-and-run and the simple slice sampler are more efficient than a hybrid slice sampler based on hit-and-run, which, itself, is more efficient than a (lazy) random walk Metropolis algorithm.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2018