Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
-
Published:2010-01-01
Issue:Proceedings
Volume:DMTCS Proceedings vol. AM,...
Page:
-
ISSN:1365-8050
-
Container-title:Discrete Mathematics & Theoretical Computer Science
-
language:en
-
Short-container-title:
Author:
Chestnut Stephen,Lladser Manuel E.
Abstract
International audience
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.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
Discrete Mathematics and Combinatorics,General Computer Science,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献