Fast exact simulation of the first-passage event of a subordinator

This paper provides an exact simulation algorithm for the sampling from the joint law of the first-passage time, the undershoot and the overshoot of a subordinator crossing a non-increasing boundary. We prove that the running time of this algorithm has finite moments of all positive orders and give an explicit bound on the expected running time in terms of the Lévy measure of the subordinator. This bound provides performance guarantees that make our algorithm suitable for Monte Carlo estimation. We provide a GitHub repository with an implementation of the algorithm in Python and Julia.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2023

Fast exact simulation of the first passage of a tempered stable subordinator across a non-increasing function

We construct a fast exact algorithm for the simulation of the first-pass...
research
04/13/2018

On the Efficiency of Localized Work Stealing

This paper investigates a variant of the work-stealing algorithm that we...
research
06/28/2021

Exact simulation of extrinsic stress-release processes

We present a new and straightforward algorithm that simulates exact samp...
research
11/17/2022

A (simple) classical algorithm for estimating Betti numbers

We describe a simple algorithm for estimating the k-th normalized Betti ...
research
12/06/2018

ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes

Given the facets of a finite simplicial complex, we use wildcards to enu...
research
07/12/2020

Technical Note – Exact simulation of the first passage time of Brownian motion to a symmetric linear boundary

We state an exact simulation scheme for the first passage time of a Brow...

Please sign up or login with your details

Forgot password? Click here to reset