Distances between Two-State Markov Processes Attainable by Markov Joinings

DOI10.2307/1998837MaRDI QIDQ4109075zbMATH OpenOpenAlexFDO

Authors Martin H. Ellis

Publication date 1978

Full work available at URL https://doi.org/10.2307/1998837

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites work

• A note on a result of Kamae
• An application of ergodic theory to probability theory
• Conditions for attaining d by a Markovian joining
• Convolution of invariant measures, maximal entropy
• Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 3463931 (Why is no real title available?)
• Stochastic inequalities on partially ordered spaces
• The \(\bar d\)-distance between two Markov processes cannot always be attained by a Markov joining

Cited in

(6)

• The \(\bar d\)-distance between two Markov processes cannot always be attained by a Markov joining
• On -convergence of Markov chains
• scientific article; zbMATH DE number 7625198 (Why is no real title available?)
• The estimation of adopted mortality and morbidity rates using model and the phase type law: the Turkish case
• Perfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite order
• Alignment and comparison of directed networks via transition couplings of random walks

This page was built for publication: Distances between Two-State Markov Processes Attainable by Markov Joinings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4109075)