Arrival time for the fastest among $N$ switching stochastic particles

Abstract

The first arrivals among $N$ Brownian particles is ubiquitous in the life sciences, as it often trigger cellular processes from the molecular level. We study here the case where stochastic particles, which represent molecules, proteins or molecules can switch between two states inside the non-negative real line. The switching process is modeled as a two-state Markov chain and particles can only escape in state 1. We estimate the fastest arrival time by solving asymptotically the Fokker-Planck equations for three different initial distributions: Dirac-delta, uniformly distributed and long-tail decay. The derived formulas reveal that the fastest particle avoid switching when the switching rates are much smaller than the diffusion time scale, but switches twice when the diffusion is state 2 is much faster than in state 1. The present results are compared to stochastic simulations revealing the range of validity of the derived formulas.

8 figures

References in corpus (7)

• First passages for a search by a swarm of independent random searchers
• Mortality, Redundancy, and Diversity in Stochastic Search
• From single-particle stochastic kinetics to macroscopic reaction rates: fastest first-passage time of $N$ random walkers
• First passage time statistics for two-channel diffusion
• Extreme first passage times for random walks on networks
• Scattering fingerprints of two-state dynamics
• Asymptotics for the fastest among n stochastics particles: role of an extended initial distribution and an additional drift component

Cited by in corpus (1)

• Inference from gated first-passage times