Analytic and Monte Carlo Approximations to the Distribution of the First Passage Time of the Drifted Diffusion with Stochastic Resetting and Mixed Boundary Conditions
arXiv:2311.03939 · doi:10.1103/PhysRevE.111.054117
Abstract
This article introduces two techniques for computing the distribution of the absorption or first passage time of the drifted Wiener diffusion subject to Poisson resetting times, to an upper hard wall barrier and to a lower absorbing barrier. The first method, which we call ``Padé-partial fraction'' approximation, starts with the Padé approximation to the Laplace transform of the first passage time distribution, which is then exactly inverted by means of the partial fraction decomposition. The second method, which we call "multiresolution algorithm", is a Monte Carlo technique that exploits the properties of the Wiener process in order to generate Brownian bridges at increasing levels of resolution. Our numerical study reveals that the multiresolution algorithm has higher efficiency than standard Monte Carlo, whereas the faster Padé-partial fraction method is accurate in various circumstances and provides an analytical formula. Also, a closed-form exact expression for the expected first passage time is derived.
References in corpus (11)
- First order transition for the optimal search time of Lévy flights with resetting
- Collective Motion due to escape and pursuit response
- Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results
- Dynamical transition in the temporal relaxation of stochastic processes under resetting
- Comment on "Mean First Passage Time for Anomalous Diffusion"
- First-passage functionals for Ornstein Uhlenbeck process with stochastic resetting
- Extremal statistics for a resetting Brownian motion before its first-passage time
- Endemic infectious states below the epidemic threshold and beyond herd immunity
- Extremal statistics for a one-dimensional Brownian motion with a reflective boundary
- A unified perspective on exponential tilt and bridge algorithms for rare trajectories of discrete Markov processes
- Biased versus unbiased numerical methods for stochastic simulations