Papers › Geometrically Convergent Simulation of the Extrema of Lévy Processes
Geometrically Convergent Simulation of the Extrema of Lévy Processes
Jorge Ignacio González Cázares, Aleksandar Mijatović, Gerónimo Uribe Bravo
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We develop a novel approximate simulation algorithm for the joint law of the position, the running supremum and the time of the supremum of a general L\'evy process at an arbitrary finite time. We identify the law of the error in simple terms. We prove that the error decays geometrically in Lᵖ (for any p≥1) as a function of the computational cost, in contrast with the polynomial decay for the approximations available in the literature. We establish a central limit theorem and construct non-asymptotic and asymptotic confidence intervals for the corresponding Monte Carlo estimator. We prove that the multilevel Monte Carlo estimator has optimal computational complexity (i.e. of order ϵ⁻² if the mean squared error is at most ϵ²) for locally Lipschitz and barrier-type functionals of the triplet and develop an unbiased version of the estimator. We illustrate the performance of the algorithm with numerical examples.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections