Exact Simulation of the Extrema of Stable Processes

Jorge Ignacio González Cázares, Aleksandar Mijatović, Gerónimo Uribe Bravo
6/5/2018
math.PRstat.CO

No confident code implementation found for this paper.

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) 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).

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{czares2018exact,
  title  = {Exact Simulation of the Extrema of Stable Processes},
  author = {Jorge Ignacio González Cázares and Aleksandar Mijatović and Gerónimo Uribe Bravo},
  year   = {2018},
  eprint = {1806.01870},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1806.01870}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1806.01870.svg)](https://codeofpaper.com/paper/1806.01870)

Discussion