Almost every finite Markov chain has only coalescing grand couplings
A grand coupling of a finite Markov chain runs copies of the chain from every state by applying independent random maps with a common law; its coalescence number is the eventual number of distinct trajectories. Grimmett and Holmes asked whether, for a random transition matrix with independent uniform weights, every grand coupling has coalescence number one almost surely. Paul answered this question affirmatively in a preliminary note (2026), from the fact that the eventual classes have equal stationary mass. We give a different proof. If some grand coupling of P has coalescence number k >= 2, then there are k states W and a partition {Z_w : w in W} of the state space with w in Z_w such that the matrix (P(w, Z_w'))_{w, w' in W} is doubly stochastic; for k equal to the number of states this is the Birkhoff-von Neumann condition. Each such condition is a non-trivial affine equation in P, and there are finitely many, so the matrices with a non-coalescing grand coupling form a Lebesgue-null set.
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24280342
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- preprint