arXiv Analytics

Sign in

arXiv:1501.07060 [math.PR]AbstractReferencesReviewsResources

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

Samuel Herrmann, Etienne Tanré

Published 2015-01-28Version 1

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.

Related articles: Most relevant | Search more
arXiv:math/0107191 [math.PR] (Published 2001-07-26, updated 2003-11-27)
Cover Times for Brownian Motion and Random Walks in Two Dimensions
arXiv:0801.2959 [math.PR] (Published 2008-01-18)
On Besov regularity of Brownian motions in infinite dimensions
arXiv:0805.4618 [math.PR] (Published 2008-05-29)
On the first passage time for Brownian motion subordinated by a Levy process