paper

Critical number of walkers for diffusive search processes with resetting

arXiv:2303.18012 · doi:10.1103/PhysRevE.107.064141

Abstract

We consider Brownian motions diffusing independently on a line, starting at , in the presence of an absorbing target at the origin. The walkers undergo stochastic resetting under two protocols: (A) each walker resets independently to with rate and (B) all walkers reset simultaneously to with rate . We compute analytically the mean first-passage time to the origin and show that, as a function of and for fixed , it has a minimum at an optimal value as long as . Thus resetting is beneficial for the search for . When , the optimal value occurs at indicating that resetting hinders search processes. Continuing our results analytically to real , we show that for protocol A and for protocol B, independently of . Our theoretical predictions are verified in numerical Langevin simulations.

15 pages, 5 figures

References in corpus (8)

Cited by in corpus (12)