Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.3150/09-BEJ238 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statisti

Scientific paper

10.3150/09-BEJ238

We present a framework for obtaining explicit bounds on the rate of convergence to equilibrium of a Markov chain on a general state space, with respect to both total variation and Wasserstein distances. For Wasserstein bounds, our main tool is Steinsaltz's convergence theorem for locally contractive random dynamical systems. We describe practical methods for finding Steinsaltz's "drift functions" that prove local contractivity. We then use the idea of "one-shot coupling" to derive criteria that give bounds for total variation distances in terms of Wasserstein distances. Our methods are applied to two examples: a two-component Gibbs sampler for the Normal distribution and a random logistic dynamical system.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-709969

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.