Convergence rates and moments of Markov chains associated with the mean of Dirichlet processes
We give necessary and sufficient conditions for geometric and polynomial ergodicity of a Markov chain on the real line with invariant distribution equal to the distribution of the mean of a Dirichlet process with parameter [alpha]. This extends the applicability of a recent MCMC method for sampling from . We show that the existence of polynomial moments of [alpha] is necessary and sufficient for geometric ergodicity, while logarithmic moments of [alpha] are necessary and sufficient for polynomial ergodicity. As corollaries it is shown that [alpha] and have polynomial moments of the same order, while the order of the logarithmic moments differ by one.
Year of publication: |
2002
|
---|---|
Authors: | Jarner, S. F. ; Tweedie, R. L. |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 101.2002, 2, p. 257-271
|
Publisher: |
Elsevier |
Keywords: | Dirichlet processes Markov chains Markov chain Monte Carlo Geometric and polynomial ergodicity Polynomial and logarithmic moments |
Saved in:
Saved in favorites
Similar items by person
-
Drift conditions and invariant measures for Markov chains
Tweedie, R. L., (2001)
-
Bounds on regeneration times and convergence rates for Markov chains
Roberts, G. O., (1999)
-
First-passage times in skip-free processes
Tweedie, R. L., (1978)
- More ...