Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T09:39:16.287Z Has data issue: false hasContentIssue false

A note on the geometric ergodicity of a Markov chain

Published online by Cambridge University Press:  01 July 2016

K. S. Chan*
Affiliation:
University of Chicago
*
∗ Postal address: Department of Statistics, The University of Chicago, Chicago, IL 60637, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

It is known that if an irreducible and aperiodic Markov chain satisfies a ‘drift' condition in terms of a non-negative measurable function g(x), it is geometrically ergodic. See, e.g. Nummelin (1984), p. 90. We extend the analysis to show that the distance between the nth-step transition probability and the invariant probability measure is bounded above by ρ n (a + bg(x)) for some constants a, b> 0 and ρ < 1. The result is then applied to obtain convergence rates to the invariant probability measures for an autoregressive process and a random walk on a half line.

Information

Type
Letters to the Editor
Copyright
Copyright © Applied Probability Trust 1989