A sandwich proof of the Shannon-McMillan-Breiman theorem (Q1107656): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:13, 5 March 2024

scientific article
Language Label Description Also known as
English
A sandwich proof of the Shannon-McMillan-Breiman theorem
scientific article

    Statements

    A sandwich proof of the Shannon-McMillan-Breiman theorem (English)
    0 references
    0 references
    0 references
    1988
    0 references
    Let \(X_ 0,X_ 1,..\). be a stationary ergodic process with Polish state space S. Let M be a reference measure on the space of all one-sided infinite sequences from S. Suppose that M is finite order Markov with stationary transition kernel. Further, suppose that for each positive integer n, the distribution \(P_ n\) of \((X_ 0,X_ 1,...,X_{n-1})\) is absolutely continuous with respect to the marginal distribution \(M_ n\) that one obtains from M by projecting on the first n coordinates. Let \(\{f_ n\}\) be the sequence of random variables \(f_ n=(dP_ n/dM_ n)(X_ 0,x_ 1,...,X_{n-1}),\quad n=1,2,...\quad.\) It is known that the sequence \(\{n^{-1} \log f_ n\}\) converges almost surely. (This result is a generalization of the Shannon-McMillan-Breiman theorem.) The authors provide a new proof of this result which involves an ingenious ``sandwiching'' of the limit superior and limit inferior of \(\{n^{-1} \log f_ n\}\) between two random variables that have the same expected value.
    0 references
    ergodic theorem of information theory
    0 references
    relative entropy rate
    0 references
    stationary ergodic process
    0 references
    Polish state space
    0 references
    reference measure
    0 references
    marginal distribution
    0 references
    generalization of the Shannon-McMillan-Breiman theorem
    0 references
    sandwiching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references