The \(\bar d\)-distance between two Markov processes cannot always be attained by a Markov joining

DOI10.1007/BF02834757zbMath0367.60079MaRDI QIDQ1242381

Martin H. Ellis

Publication date: 1976

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (3)

Perfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite order ⋮ Unnamed Item ⋮ Distances between Two-State Markov Processes Attainable by Markov Joinings

Cites Work

• An application of ergodic theory to probability theory
• Distances between Two-State Markov Processes Attainable by Markov Joinings
• Unnamed Item

This page was built for publication: The \(\bar d\)-distance between two Markov processes cannot always be attained by a Markov joining