Optimal mean first-passage time for a Brownian searcher subjected to resetting: experimental and theoretical results
Abstract: We study experimentally and theoretically the optimal mean time needed by a free diffusing Brownian particle to reach a target at a distance L from an initial position in the presence of resetting. Both the initial position and the resetting position are Gaussian distributed with width $\sigma$. We derived and tested two resetting protocols, one with a periodic and one with random (Poissonian) resetting times. We computed and measured the full first-passage probability distribution that displays spectacular spikes immediately after each resetting time for close targets. We study the optimal mean first-passage time as a function of the resetting period/rate for different values of the ratio b = L/$\sigma$ and find an interesting phase transtion at a critical value b = bc. For bc < b < $\infty$, there is a metastable optimum time which disappears for b < bc. The intrinsic diffculties in implementing these protocols in experiments are also discussed.
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.