Abstract
The paper defines and studies thin times which are random times whose graph is contained in a countable union of graphs of stopping times with respect to a reference filtration F. We show that a generic random time can be decomposed into thin and thick parts, where the second is a random time avoiding all F-stopping times. Then, for a given random time τ, we introduce Fτ, the smallest right-continuous filtration containing F and making τ a stopping time, and we show that, for a thin time τ, each F-martingale is an Fτ-semimartingale, i.e., the hypothesis (H′) for (F,Fτ) holds. We present applications to honest times, which can be seen as last passage times, showing classes of filtrations which can only support thin honest times, or can accommodate thick honest times as well.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
