## Convergence of Markov Chain Monte Carlo Algorithms with Applications to Image Restoration (2000)

Citations: | 2 - 1 self |

### BibTeX

@MISC{Gibbs00convergenceof,

author = {Alison L. Gibbs},

title = {Convergence of Markov Chain Monte Carlo Algorithms with Applications to Image Restoration},

year = {2000}

}

### OpenURL

### Abstract

Markov chain Monte Carlo algorithms, such as the Gibbs sampler and Metropolis-Hastings algorithm, are widely used in statistics, computer science, chemistry and physics for exploring complicated probability distributions. A critical issue for users of these algorithms is the determination of the number of iterations required so that the result will be approximately a sample from the distribution of interest. In this thesis, we give precise bounds on the convergence time of the Gibbs sampler used in the Bayesian restoration of a degraded image. We consider convergence as measured by both the usual choice of metric, total variation distance, and the Wasserstein metric. In both cases we exploit the coupling characterisation of the metric to get our results. Our results can also be applied to the coupling-from-the-past algorithm of Propp and Wilson (1996) to get bounds on its running time. The application of our theoretical results requires the computation of parameters