Slow hit-and-run sampling
type: Item
instance of: scholarly article
title: Slow hit-and-run sampling
zbMATH Open document ID: 0954.60053
DOI: 10.1016/S0167-7152(99)00134-0
author: Claude Bélisle
published in: Statistics \& Probability Letters
publication date: 2001-02-05T00:00:00Z
review text: Consider a probability measure \(\pi\) on \(\mathbb{R}^d\). Assume that \(\pi\) is absolutely continuous and has density \(f\) with respect to the Lebesgue measure. Let \(S_d= \{\theta\in \mathbb{R}^d:\|\theta\|= 1\}\) be the \(d\)-dimensional unit sphere centered at the origin. For every \(\theta\in S_d\), let \(P_{(\theta, \pi)}\) be the Markov kernel on \((\mathbb{R}^d,{\mathcal B}^d)\) defined by \[ P_{(\theta,\pi)}(x, B)= {\int^\infty_{-\infty} 1_B(x+ r\theta) f(x+ r\theta) dr\over \int^\infty_{-\infty} f(x+ \lambda\theta) d\lambda}, \] and for any probability measure \(\upsilon\) on \(S_d\), let \(P_{(\upsilon,\pi)}\) denote the Markov kernel on \((\mathbb{R}^d,{\mathcal B}^d)\) defined by \[ P_{(\upsilon,\pi)}(x, B)= \int_{S^d} P_{(\theta,\pi)} (x,B)\upsilon(d\theta). \] The latter is called the hit-and-run sampler with direction distribution \(\upsilon\) and target distribution \(\pi\). It is shown that the hit-and-run sampler can converge to its target distribution at an arbitrarily slow rate. It is also illustrated how the speed of convergence of the hit-and-run sampler can be affected by small perturbations of the target distribution.
reviewed by: Marius Iosifescu
Mathematics Subject Classification ID: 60J05
Mathematics Subject Classification ID: 65C05
zbMATH DE Number: 1428604
zbMATH Keywords: Markov kernel
zbMATH Keywords: hit-and-run sampler
zbMATH Keywords: small perturbations
zbMATH Keywords: target distribution
MaRDI profile type: Publication
cites work: On the convergence of the Markov chain simulation method
cites work: Hit-and-Run Algorithms for Generating Multivariate Distributions
cites work: Convergence properties of hit–and–run samplers
cites work: Slow convergence of the Gibbs sampler
cites work: Hit-and-run algorithms for the identification of nonredundant linear inequalities
cites work: Sampling-Based Approaches to Calculating Marginal Densities
cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
cites work: Hit-and-run mixes fast
cites work: On convergence rates of Gibbs samplers for uniform distributions
cites work: Convergence Properties of Perturbed Markov Chains
cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
full work available at URL: s0167-7152(99)00134-0
OpenAlex ID: W2068828332
Wikidata QID: Q127594991
description: scientific article; zbMATH DE number 1428604