Abstract: Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and then stick together. There is, however, a very peculiar kind of discrete finite Markov chain, for which two copies started in different states can be coupled to meet almost surely in finite time, yet their distributions keep a total variation distance bounded away from 0, even in the limit as time goes off to infinity. We show that the supremum of total variation distance kept in this context is .
Recommendations
- scientific article; zbMATH DE number 4058573
- Separation and coupling cutoffs for tuples of independent Markov processes
- scientific article; zbMATH DE number 4052721
- A variant of the Skorokhod theorem for Markov sequences
- Reduction of Markov chains with two-time-scale state transitions
- Characterization of cutoff for reversible Markov chains
- Total variation cutoff in birth-and-death chains
Cites work
- scientific article; zbMATH DE number 1245556 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- A note on disagreement percolation
- Faithful couplings of Markov chains: Now equals forever
- Foundations of Modern Probability
- Variable length path coupling
Cited in
(2)
This page was built for publication: Segregating Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800944)
