Exact Simulation of the Extrema of Stable Processes
Probability
2020-08-26 v2 Computation
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\'evy processes) and apply 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 numerically the performance of the algorithm (the code, written in Julia 1.0, is available on GitHub).
Keywords
Cite
@article{arxiv.1806.01870,
title = {Exact Simulation of the Extrema of Stable Processes},
author = {Jorge Ignacio González Cázares and Aleksandar Mijatović and Gerónimo Uribe Bravo},
journal= {arXiv preprint arXiv:1806.01870},
year = {2020}
}
Comments
26 pages, 3 figures, Julia implementation of the exact simulation algorithm is in the GitHub repository: https://github.com/jorgeignaciogc/StableSupremum.jl