On the characterisation of honest times that avoid all stopping times
classification
🧮 math.PR
keywords
timetimeshonestlocalrunningstoppingsupremumavoid
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.