On a dyadic approximation of predictable processes of finite variation

From MaRDI portal
Publication:743377

DOI10.1214/ECP.V19-2972zbMATH Open1333.60058arXiv1306.6238MaRDI QIDQ743377FDOQ743377


Authors: Pietro Siorpaes Edit this on Wikidata


Publication date: 24 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: We show that any cadlag predictable process of finite variation is an a.s. limit of elementary predictable processes; it follows that predictable stopping times can be approximated `from below' by predictable stopping times which take finitely many values. We then obtain as corollaries two classical theorems: predictable stopping times are announceable, and an increasing process is predictable iff it is natural.


Full work available at URL: https://arxiv.org/abs/1306.6238




Recommendations





Cited In (11)





This page was built for publication: On a dyadic approximation of predictable processes of finite variation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743377)