Papers › Optimal mean first-passage time of a Brownian searcher with resetting in one and two...
Optimal mean first-passage time of a Brownian searcher with resetting in one and two dimensions: Experiments, theory and numerical tests
Felix Faisant, Benjamin Besga, Artyom Petrosyan, Sergio Ciliberto, Satya N. Majumdar
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study experimentally, numerically and theoretically the optimal mean time needed by a Brownian particle, freely diffusing either in one or two dimensions, to reach, within a tolerance radius Rₜₒₗ, a target at a distance L from an initial position in the presence of resetting. The reset position is Gaussian distributed with width σ. 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 target distances (values of the ratios b=L/σ) and target size (a=Rₜₒₗ/L). We find an interesting phase transition at a critical value of b, both in one and two dimensions. The details of the calculations as well as experimental setup and limitations are discussed.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections