2000 character limit reached
On maximal agreement couplings (1608.01511v1)
Published 4 Aug 2016 in math.PR
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.