Poisson limit theorem for countable Markov chains in Markovian environments
- 29 Downloads
A countable Markov chain in a Markovian environment is considered. A Poisson limit theorem for the chain recurring to small cylindrical sets is mainly achieved. In order to prove this theorem, the entropy function h is introduced and the Shannon-McMillan-Breiman theorem for the Markov chain in a Markovian environment is shown. It's well-known that a Markov process in a Markovian environment is generally not a standard Markov chain, so an example of Poisson approximation for a process which is not a Markov process is given. On the other hand, when the environmental process degenerates to a constant sequence, a Poisson limit theorem for countable Markov chains, which is the generalization of Pitskel's result for finite Markov chains is obtained.
Key wordsPoisson distributions Markov chains random environments
Chinese Library ClassificationO211.62
2000 MR Subject Classification60J05 60J10
Unable to display preview. Download preview PDF.
- Cornfeld I P, Fomin S, Sinai Ya G.Ergodic Theory[M]. New York: Springer-Verlag, 1982.Google Scholar