pith. sign in

arxiv: 1501.07060 · v2 · pith:K4PWMSDDnew · submitted 2015-01-28 · 🧮 math.PR

The first-passage time of the Brownian motion to a curved boundary: an algorithmic approach

classification 🧮 math.PR
keywords timebrownianfirst-passagemotionboundarycurvedsimulatealgorithm
0
0 comments X
read the original abstract

Under some weak conditions, the first-passage time of the Brownian motion to a continuous curved boundary is an almost surely finite stopping time. Its probability density function (pdf) is explicitly known only in few particular cases. Several mathematical studies proposed to approximate the pdf in a quite general framework or even to simulate this hitting time using a discrete time approximation of the Brownian motion. The authors study a new algorithm which permits to simulate the first-passage time using an iterating procedure. The convergence rate presented in this paper suggests that the method is very efficient.

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.