Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2010_special_258_a25,
     author = {Chestnut, Stephen and Lladser, Manuel E.},
     title = {Occupancy distributions in {Markov} chains via {Doeblin's} ergodicity coefficient},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2789},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2789/}
}
TY  - JOUR
AU  - Chestnut, Stephen
AU  - Lladser, Manuel E.
TI  - Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2789/
DO  - 10.46298/dmtcs.2789
LA  - en
ID  - DMTCS_2010_special_258_a25
ER  - 
%0 Journal Article
%A Chestnut, Stephen
%A Lladser, Manuel E.
%T Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2789/
%R 10.46298/dmtcs.2789
%G en
%F DMTCS_2010_special_258_a25
Chestnut, Stephen; Lladser, Manuel E. Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2789. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2789/

Cité par Sources :