Coding a stationary process to one with prescribed marginals (Q582687)

From MaRDI portal
Revision as of 07:27, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Coding a stationary process to one with prescribed marginals
scientific article

    Statements

    Coding a stationary process to one with prescribed marginals (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    It is shown that any aperiodic automorphism T preserving the measure \(\mu\) has a partition \(\{P_ i:\) \(i\in {\mathbb{N}}\}\) so that \[ \mu (P_ i\cap t^{-1}P_ j)=\mu (P_ i)p_{ij}=\pi_ ip_{ij} \] where \((p_{ij}\), \(i,j\in {\mathbb{N}})\) denotes the transition probabilities of a given positive recurrent irreducible Markov chain with invariant initial distribution \((\pi_ i)_{i\in {\mathbb{N}}}\). In the case of a finite state space this theorem is a consequence of \textit{Chr. Grillenberger} and \textit{U. Krengel} [Math. Z. 149, 131-154 (1976; Zbl 0313.60029)].
    0 references
    stationary process
    0 references
    measure theoretic isomorphism
    0 references
    positive recurrent irreducible Markov chain
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references