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-passage time, jointly with the undershoot and overshoot, of a tempered stable subordinator over an arbitrary non-increasing absolutely continuous function. We prove that the running time of our algorithm has finite exponential moments and provide bounds on its expected running time with explicit dependence on the characteristics of the process and the initial value of the function. The expected running time grows at most cubically in the stability parameter (as it approaches either 0 or 1) and is linear in the tempering parameter and the initial value of the function. Numerical performance, based on the implementation in the dedicated GitHub repository, exhibits a good agreement with our theoretical bounds. We provide numerical examples to illustrate the performance of our algorithm in Monte Carlo estimation.

READ FULL TEXT
research
06/12/2023

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

This paper provides an exact simulation algorithm for the sampling from ...
research
10/29/2019

ε-strong simulation of the convex minorants of stable processes and meanders

Using marked Dirichlet processes we characterise the law of the convex m...
research
04/30/2018

A Subquadratic Algorithm for 3XOR

Given a set X of n binary words of equal length w, the 3XOR problem asks...
research
04/13/2018

On the Efficiency of Localized Work Stealing

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

Phase Transitions of the Moran Process and Algorithmic Consequences

The Moran process is a randomised algorithm that models the spread of ge...
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
02/23/2021

Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms

With the goal to provide absolute lower bounds for the best possible run...

Please sign up or login with your details

Forgot password? Click here to reset