Optimal searcher distribution for parallel random target searches

Random search for a partially reactive target by multiple diffusive searchers

We study the first-passage problem for a partially reactive target by N identical diffusive particles in a finite d-dimensional space, laying a focus on the effects of the partial reactivity when searchers are initially excluded from the target region. By solving the Fokker-Planck equation, we obtain the mean first-passage time that exhibits a power-law dependence on the number of searchers as τ_{N}∼N^{-α}, proving that the exponent α varies with dimensionality, reactivity, and the number of searchers, and specifying conditions in which crossovers between different exponents occur. We confirm the validity of our analytic results by performing Langevin dynamics simulations for various sets of system parameters.

Active search for a reactive target in thermal environments

We study a stochastic process where an active particle, modeled by a one-dimensional run-and-tumble particle, searches for a target with a finite absorption strength in thermal environments. Solving the Fokker-Planck equation for a uniform initial distribution, we analytically calculate the mean searching time (MST), the time for the active particle to be finally absorbed, and show that there exists an optimal self-propulsion velocity of the active particle at which MST is minimized. As the diffusion constant increases, the optimal velocity changes from a finite value to zero, which implies that a purely diffusive Brownian motion outperforms an active motion in terms of searching time. Depending on the absorption strength of the target, the transition of the optimal velocity becomes either continuous or discontinuous, which can be understood based on the Landau approach. In addition, we obtain the phase diagram indicating the passive-efficient and the active-efficient regions. Finally, the initial condition dependence of MST is presented in limiting cases.

Searching for a partially absorbing target by a run-and-tumble particle in a confined space

A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a nonmonotonic behavior as a function of the self-propulsion speed of the active particle, indicating the existence of an optimal speed, when the absorption strength of the target is finite. In the limit of large and small absorption strengths, respectively, asymptotes of the mean searching time and the optimal speed are found. We also demonstrate that the first-passage problem of a diffusive run-and-tumble particle in high dimensions can be mapped into a one-dimensional problem with a partially absorbing target. Finally, as a practical application exploiting the existence of the optimal speed, we propose a filtering device to extract active particles with a desired speed and evaluate how the resolution of the filtering device depends on the absorption strength.

Target searches of interacting Brownian particles in dilute systems

We study the target searches of interacting Brownian particles in a finite domain, focusing on the effect of interparticle interactions on the search time. We derive the integral equation for the mean first-passage time and acquire its solution as a series expansion in the orders of the Mayer function. We analytically obtain the leading order correction to the search time for dilute systems, which are most relevant to target search problems and prove a universal relation given by the particle density and the second virial coefficient. Finally, we validate our theoretical prediction by Langevin dynamics simulations for the various types of the interaction potential.