First passages for a search by a swarm of independent random searchers
C.Mejia-Monasterio, G. Oshanin, G. Schehr

TL;DR
This paper investigates the distribution of first passage times for a swarm of independent random searchers and reveals that mean first passage time may not reliably measure search efficiency due to significant fluctuations.
Contribution
It introduces a new analysis of the distribution of normalized first passage times for multiple searchers, highlighting non-trivial behaviors and limitations of mean-based metrics.
Findings
Distribution P(ω) shows non-trivial behavior.
Mean first passage time is not always a robust measure.
Significant sample-to-sample fluctuations affect data interpretation.
Abstract
In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same point in space. For each realization of the search process, we record the unordered set of time moments \{\tau_k\}, where \tau_k is the time of the first passage of the k-th searcher to the location of the target. Clearly, \tau_k's are independent, identically distributed random variables with the same distribution function \Psi(\tau). We evaluate then the distribution P(\omega) of the random variable \omega \sim \tau_1/bar{\tau}, where bar{\tau} = N^{-1} \sum_{k=1}^N \tau_k is the ensemble-averaged realization-dependent first passage time. We show that P(\omega) exhibits quite a non-trivial and sometimes a counterintuitive behaviour. We demonstrate that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
