Information Theory and Reliable Communication
Information Theory and Reliable Communication
Large Deviation Principle for Markov Chains in Continuous Time
Problems of Information Transmission
Large Deviations Rate Function for Polling Systems
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
Let E be a denumerable state space and X be a homogeneous Markov chain on E with kernel P. Then the chain X verifies a weak Sanov's theorem, i.e., a weak large deviation principle holds for the law of the pair empirical measure. This LDP holds for any discrete state space Markov chain, not necessarily ergodic or irreducible. It is also known that a strong LDP cannot hold in the present framework. The result is obtained by a new method, which allows us to extend the LDP from a finite state space setting to a denumerable one, somehow like the projective limit approach. The analysis presented here offers some by-products, among which there are a contraction principle for the weak LDP, leading directly to a weak Sanov's theorem for the one-dimensional empirical measure. A refined analysis of the ubiquitous entropy function H proves to be useful in other frameworks, e.g., continuous time or stochastic networks, and allows us to improve the sharpness of asymptotics.