First passage time in space-dependent stochastic resetting
arXiv:2509.11809 · doi:10.1103/w2yj-91m8
Abstract
We consider the mean first passage time (MFPT) through a target of interest for a diffusive particle of Langevin type, with the added condition that the particle is reset to its original position with some rate . We study both smooth and non-smooth, non-convex potentials, focusing on the case where the reset rate depends on the space coordinate. For quadratic and piecewise-quadratic potentials, we show that the benefits of resetting depend on the ratio between drift and noise, and become more important as the drift potential becomes smaller compared to the noise. When the target is a local optimum of the potential, we further show that it is beneficial to use a space-dependent resetting where the reset rate is lower when the particle is closer to the target.
arXiv commentv.2: Published version. Added numerical experiments and new figures after reviewer comments
References in corpus (17)
- Diffusion with Stochastic Resetting
- Stochastic Resetting and Applications
- Diffusion with Optimal Resetting
- First Passage Under Restart
- Diffusion in a potential landscape with stochastic resetting
- Diffusion with resetting in arbitrary spatial dimension
- The Modern Mathematics of Deep Learning
- First passage of a particle in a potential under stochastic resetting: a vanishing transition of optimal resetting rate
- Péclet number governs transition to acceleratory restart in drift-diffusion
- Diffusion with resetting in a logarithmic potential
- Landau theory of restart transitions
- Path-integral formalism for stochastic resetting: Exactly solved examples and shortcuts to confinement
- First passage under restart for discrete space and time: application to one dimensional confined lattice random walks
- First passage in the presence of stochastic resetting and a potential barrier
- Universal performance bounds of restart
- Stochastic Resetting Mitigates Latent Gradient Bias of SGD from Label Noise
- Parallel variational quantum algorithms with gradient-informed restart to speed up optimisation in the presence of barren plateaus