Entropy and large deviations for discrete-time Markov chains (Q1812373)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Entropy and large deviations for discrete-time Markov chains
scientific article

    Statements

    Entropy and large deviations for discrete-time Markov chains (English)
    0 references
    13 January 2004
    0 references
    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.
    0 references
    0 references
    discrete-time Markov chains
    0 references
    entropy
    0 references
    large deviations
    0 references
    weak Sanov theorem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references