pith. sign in

arxiv: 1705.06881 · v1 · pith:6KAZPSB5new · submitted 2017-05-19 · 🧮 math.PR

Exact simulation of the first-passage time of diffusions

classification 🧮 math.PR
keywords first-passagesimulationtimediffusionefficiencyexactpathsprocesses
0
0 comments X
read the original abstract

Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations of the first-passage times as a by-product. For efficiency reasons, it is particularly challenging to simulate directly this hitting time by avoiding to construct the whole paths. In the Brownian case, the distribution of the first-passage time is explicitly known and can be easily used for simulation purposes. The authors introduce a new rejection sampling algorithm which permits to perform an exact simulation of the first-passage time for general one-dimensional diffusion processes. The efficiency of the method, which is essentially based on Girsanov's transformation , is described through theoretical results and numerical examples.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.