Article contents
Exact simulation of the extrema of stable processes
Published online by Cambridge University Press: 15 November 2019
Abstract
We exhibit an exact simulation algorithm for the supremum of a stable process over a finite time interval using dominated coupling from the past (DCFTP). We establish a novel perpetuity equation for the supremum (via the representation of the concave majorants of Lévy processes [27]) and use it to construct a Markov chain in the DCFTP algorithm. We prove that the number of steps taken backwards in time before the coalescence is detected is finite. We analyse the performance of the algorithm numerically (the code, written in Julia 1.0, is available on GitHub).
Keywords
- Type
- Original Article
- Information
- Copyright
- © Applied Probability Trust 2019
References
- 6
- Cited by