Papers
Topics
Authors
Recent
Search
2000 character limit reached

On maximal agreement couplings

Published 4 Aug 2016 in math.PR | (1608.01511v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.