Coding a Stationary Process to One with Prescribed Marginals
Alpern, S. ; Prasad, V. S.
Ann. Probab., Tome 17 (1989) no. 4, p. 1658-1663 / Harvested from Project Euclid
In this paper we consider the problem of coding a given stationary stochastic process to another with a prescribed marginal distribution. This problem after reformulation is solved by proving the following theorem. Let $(M, \mathscr{A}, \mu)$ be a Lebesgue probability space and let $\sigma$ be an antiperiodic bimeasurable $\mu$-preserving automorphism of $M.$ Let $\mathbf{N}$ be the set of nonnegative integers. Suppose that $(p_{i, j}: i, j \in \mathbf{N})$ are the transition probabilities of a positive recurrent, aperiodic, irreducible Markov chain with state space $\mathbf{N}$ and that $\pi = (\pi_i), i \in \mathbf{N},$ is the unique positive invariant distribution $\pi_j = \sum_{i \in \mathbf{N}}\pi_i p_{i, j}.$ Then there is a partition $\mathbf{P} = \{P_i\}_{i \in \mathbf{N}}$ of $M$ such that for all $i, j \in \mathbf{N}, \mu(P_i \cap \sigma^{-1}P_j) = \mu(P_i)p_{i, j} = \pi_ip_{i, j}.$
Publié le : 1989-10-14
Classification:  Stationary stochastic process,  Markov transitions,  coding,  partitions,  dynamical system,  measure preserving transformation,  mixing,  28D05,  60G10,  60J10
@article{1176991180,
     author = {Alpern, S. and Prasad, V. S.},
     title = {Coding a Stationary Process to One with Prescribed Marginals},
     journal = {Ann. Probab.},
     volume = {17},
     number = {4},
     year = {1989},
     pages = { 1658-1663},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176991180}
}
Alpern, S.; Prasad, V. S. Coding a Stationary Process to One with Prescribed Marginals. Ann. Probab., Tome 17 (1989) no. 4, pp.  1658-1663. http://gdmltest.u-ga.fr/item/1176991180/