2016/08/04 by Florian Völlering, Völlering, Florian · 1 citation
Computer Science · Engineering · #Advanced Algebra and Logic #FOS: Mathematics #Probability (math.PR) #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1608.01511
openalex publication_date 2016/08/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We call a coupling of two stochastic processes which maximizes the time until the first disagreement a maximal agreement coupling. We show that such a coupling always exists. Furthermore, it is possible to construct a lower bound on the disagreement time which is independent of one of the two processes.