Papers
Topics
Authors
Recent
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.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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