On a dyadic approximation of predictable processes of finite variation
From MaRDI portal
(Redirected from Publication:743377)
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.
Recommendations
Cited in
(13)- On natural and predictable processes
- Pathwise stochastic calculus with local times
- On the compensator in the Doob-Meyer decomposition of the Snell envelope
- Optional processes with non-exploding realized power variation along stopping times are làglàd
- Optional processes with non-exploding realized power variation along stopping times are làglàd
- An abstract decomposition of measures and its many applications
- Dyadic approximation of double integrals with respect to symmetric stable processes
- An elementary approach to naturality, predictability, and the fundamental theorem of local martingales
- PREDICTABILITY OF MULTIPLICATIVE PROCESSES: A PRELIMINARY STUDY
- scientific article; zbMATH DE number 3967575 (Why is no real title available?)
- WEAK PREDICTABLE PROCESSES IN FINITE VON NEUMANN ALGEBRAS
- On the two-sided predictable approximation for stochastic processes
- scientific article; zbMATH DE number 3972037 (Why is no real title available?)
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)