English

Coupling Markov chains with a common image chain

Probability 2026-04-21 v2

Abstract

Consider time-homogeneous discrete-time Markov chains XX, YY, and ZZ on countable state spaces, considered as stochastic processes with specified initial distributions. Suppose for maps ff and gg that (f(Xt))t0(f(X_t))_{t \ge 0} and (g(Yt))t0(g(Y_t))_{t \ge 0} are both equal in law to ZZ. We prove that XX and YY can be coupled so that (Xt,Yt)t0(X_t, Y_t)_{t \ge 0} is a homogeneous Markov chain with f(Xt)=g(Yt)f(X_t) = g(Y_t) for all t0t \ge 0. Without the assumption that ZZ is Markov, no such Markov coupling exists in general, even an inhomogeneous one. Moreover, we give an explicit construction of such a coupling, with the additional property that XX and YY are conditionally independent given the entire trajectory (f(Xt))t0(f(X_t))_{t \ge 0}. Under the further assumption that XX and YY are stationary, we construct a coupling having the above properties that is also stationary. In this case, conditional independence holds for the corresponding two-sided chains indexed by Z\mathbb{Z} (but not necessarily for the one-sided versions). We prove further properties of our couplings in special cases where ff or gg satisfies the strong lumping condition (also known as Dynkin's condition) or the exact lumping condition (also known as the Pitman-Rogers condition). When ff is a strong lumping and gg is an exact lumping, we show that our coupling coincides with an intertwining of Markov chains as constructed by Diaconis and Fill.

Keywords

Cite

@article{arxiv.2604.12853,
  title  = {Coupling Markov chains with a common image chain},
  author = {Edward Crane and Alexander E. Holroyd and Erin Russell},
  journal= {arXiv preprint arXiv:2604.12853},
  year   = {2026}
}
R2 v1 2026-07-01T12:09:03.749Z