One-shot coupling for certain stochastic recursive sequences
We consider Markov chains {[Gamma]n} with transitions of the form [Gamma]n=f(Xn,Yn)[Gamma]n-1+g(Xn,Yn), where {Xn} and {Yn} are two independent i.i.d. sequences. For two copies {[Gamma]n} and {[Gamma]n'} of such a chain, it is well known that provided E[log(f(Xn,Yn))]<0, where => is weak convergence. In this paper, we consider chains for which also [Gamma]n-[Gamma]n'-->0, where · is total variation distance. We consider in particular how to obtain sharp quantitative bounds on the total variation distance. Our method involves a new coupling construction, one-shot coupling, which waits until time n before attempting to couple. We apply our results to an auto-regressive Gibbs sampler, and to a Markov chain on the means of Dirichlet processes.
Year of publication: |
2002
|
---|---|
Authors: | Roberts, Gareth O. ; Rosenthal, Jeffrey S. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 99.2002, 2, p. 195-208
|
Publisher: |
Elsevier |
Keywords: | Markov chain Coupling Convergence bounds Stochastic recursive sequence One-shot coupling Gibbs sampler Dirichlet process |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A note on geometric ergodicity and floating-point roundoff error
Breyer, Laird, (2001)
-
Scaling limits for the transient phase of local Metropolis-Hastings algorithms
Christensen, Ole F., (2005)
-
Convergence of Slice Sampler Markov Chains
Roberts, Gareth O., (1999)
- More ...