On Kamae's conjecture concerning the d-distance between two-state Markov processes
From MaRDI portal
Publication:1137324
DOI10.1214/aop/1176994784zbMath0428.60081OpenAlexW2047661055WikidataQ123321422 ScholiaQ123321422MaRDI QIDQ1137324
Publication date: 1980
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aop/1176994784
Markov processMarkov chainpartition distancestationary random processd-distanced-distance equalling partition distancejoint process
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 ⋮ On -convergence of Markov chains
This page was built for publication: On Kamae's conjecture concerning the d-distance between two-state Markov processes