2000 character limit reached
First passage times under frequent stochastic resetting
Published 10 Feb 2023 in cond-mat.stat-mech, math-ph, math.MP, and math.PR | (2302.05409v2)
Abstract: We determine the full distribution and moments of the first passage time for a wide class of stochastic search processes in the limit of frequent stochastic resetting. Our results apply to any system whose short-time behavior of the search process without resetting can be estimated. In addition to the typical case of exponentially distributed resetting times, we prove our results for a wide array of resetting time distributions. We illustrate our results in several examples and show that the errors of our approximations vanish exponentially fast in typical scenarios of diffusive search.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.