The First-passage Time of the Brownian Motion to a Curved Boundary: an Algorithmic Approach
- 1 January 2016
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 38 (1) , A196-A215
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 one to simulate the first-passage time using an iterating procedure. The convergence rate presented in this paper suggests that the method is very efficient.Keywords
All Related Versions
This publication has 41 references indexed in Scilit:
- Efficient Estimation of One-Dimensional Diffusion First Passage Time Densities via Monte Carlo SimulationJournal of Applied Probability, 2011
- System reliability based on diffusion models for fatigue crack growthNaval Research Logistics (NRL), 2004
- Asymptotics of hitting probabilities for general one-dimensional pinned diffusionsThe Annals of Applied Probability, 2002
- An improved technique for the simulation of first passage times for diffusion processesCommunications in Statistics - Simulation and Computation, 1999
- Pricing Barrier Options with Time–Dependent CoefficientsMathematical Finance, 1997
- On evaluations and asymptotic approximations of first-passage-time probabilitiesAdvances in Applied Probability, 1996
- The first-passage density of the Brownian motion process to a curved boundaryJournal of Applied Probability, 1992
- On an integral equation for first-passage-time probability densitiesJournal of Applied Probability, 1984
- The maximum size of a closed epidemicAdvances in Applied Probability, 1974
- Level-crossing problems for random processesIEEE Transactions on Information Theory, 1973