Coding a stationary process to one with prescribed marginals
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)].
- The evolution of aggregated Markov chains
- On stationary Markov chains and independent random variables
- scientific article; zbMATH DE number 3871709
- Markov chains with positive transitions are not determined by any p-marginals
- MultiTowers, conjugacies and codes: Three theorems in Ergodic theory, one variation on Rokhlin’s Lemma
- Finitary coding for the one-dimensional \(T,T^{-1}\) process with drift.
- Markov chains with positive transitions are not determined by any p-marginals
- scientific article; zbMATH DE number 1305632 (Why is no real title available?)
- Anosov maps with rectangular holes. Nonergodic cases
- scientific article; zbMATH DE number 1452970 (Why is no real title available?)
- Rotational (and Other) Representations of Stochastic Matrices
- Sur les processus quasi-Markoviens et certains de leurs facteurs
- Approximation with ergodic processes and testability
- Dynamics, data, and reconstruction
- Return times for nonsingular measurable transformations
This page was built for publication: Coding a stationary process to one with prescribed marginals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582687)
