Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the characterisation of honest times that avoid all stopping times

Published 13 Feb 2012 in math.PR | (1202.2882v4)

Abstract: We present a short and self-contained proof of the following result: a random time is an honest time that avoids all stopping times if and only if it coincides with the (last) time of maximum of a nonnegative local martingale with zero terminal value and no jumps while at its running supremum, where the latter running supremum process is continuous. Illustrative examples involving local martingales with discontinuous paths are provided.

Summary

Paper to Video (Beta)

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.