Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient

  • Chestnut S
  • Lladser M
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We state and prove new properties about Doeblin's ergodicity coefficient for finite Markov chains. We show that this coefficient satisfies a sub-multiplicative type inequality (analogous to the Markov-Dobrushin's ergodicity coefficient), and provide a novel but elementary proof of Doeblin's characterization of weak-ergodicity for non-homogeneous chains. Using Doeblin's coefficient, we illustrate how to approximate a homogeneous but possibly non-stationary Markov chain of duration $n$ by independent and short-lived realizations of an auxiliary chain of duration of order $\ln (n)$. This leads to approximations of occupancy distributions in homogeneous chains, which may be particularly useful when exact calculations via one-step methods or transfer matrices are impractical, and when asymptotic approximations may not be yet reliable. Our findings may find applications to pattern problems in Markovian and non-Markovian sequences that are treatable via embedding techniques.

Cite

CITATION STYLE

APA

Chestnut, S., & Lladser, M. E. (2010). Occupancy distributions in Markov chains via Doeblin’s ergodicity coefficient. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AM,...(Proceedings). https://doi.org/10.46298/dmtcs.2789

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free