Entropy and large deviations for discrete-time Markov chains

From MaRDI portal





The authors propose a new method to prove a weak Sanov theorem for a homogeneous discrete-time Markov chain with denumerable state space, which is not necessarily ergodic or irreducible. In fact, they show how a careful analysis of the entropy function combined with change of measures leads to a new proof of a weak large deviation principle for the law of the pair empirical measure.




Cited in
(31)








This page was built for publication: Entropy and large deviations for discrete-time Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812373)