Distribution of extreme first passage times of diffusion

Abstract

Many events in biology are triggered when a diffusing searcher finds a target, which is called a first passage time (FPT). The overwhelming majority of FPT studies have analyzed the time it takes a single searcher to find a target. However, the more relevant timescale in many biological systems is the time it takes the fastest searcher(s) out of many searchers to find a target, which is called an extreme FPT. In this paper, we apply extreme value theory to find a tractable approximation for the full probability distribution of extreme FPTs of diffusion. This approximation can be easily applied in many diverse scenarios, as it depends on only a few properties of the short time behavior of the survival probability of a single FPT. We find this distribution by proving that a careful rescaling of extreme FPTs converges in distribution as the number of searchers grows. This limiting distribution is a type of Gumbel distribution and involves the LambertW function. This analysis yields new explicit formulas for approximations of statistics of extreme FPTs (mean, variance, moments, etc.) which are highly accurate and are accompanied by rigorous error estimates.

26 pages, 3 figures

References in corpus (6)

• Strong defocusing of molecular reaction times results from an interplay of geometry and reaction control
• Mortality, Redundancy, and Diversity in Stochastic Search
• Full distribution of first exit times in the narrow escape problem
• Universal Formula for Extreme First Passage Statistics of Diffusion
• Exit time distribution in spherically symmetric two-dimensional domains
• First Invader Dynamics in Diffusion-Controlled Absorption

Cited by in corpus (28)

• From single-particle stochastic kinetics to macroscopic reaction rates: fastest first-passage time of $N$ random walkers
• Competition between slow and fast regimes for extreme first passage times of diffusion
• Extreme first passage times for random walks on networks
• Joint distribution of multiple boundary local times and related first-passage time problems with multiple targets
• Depletion of Resources by a Population of Diffusing Species
• Search efficiency in the Adam-Delbrück reduction-of-dimensionality scenario versus direct diffusive search
• Extreme hitting probabilities for diffusion
• Being Heterogeneous Is Advantageous: Extreme Brownian Non-Gaussian Searches
• First-passage times of multiple diffusing particles with reversible target-binding kinetics
• Extreme statistics of anomalous subdiffusion following a fractional Fokker-Planck equation: Subdiffusion is faster than normal diffusion
• Distribution of first-reaction times with target regions on boundaries of shell-like domains
• Reversible Target-Binding Kinetics of Multiple Impatient Particles
• First Passage Time for Many Particle Diffusion in Space-Time Random Environments
• Accurately approximating extreme value statistics
• First passage time and change of entropy
• Capture of a diffusive prey by multiple predators in confined space
• A molecular relay race: sequential first-passage events to the terminal reaction centre in a cascade of diffusion controlled processes
• Fastest first-passage time statistics for time-dependent particle injection
• Contact statistics in populations of noninteracting random walkers in two dimensions
• Target Searches of Interacting Brownian Particles
• Optimal Searcher Distribution for Parallel Random Target Searches
• Kinetic Monte Carlo methods for three-dimensional diffusive capture problems in exterior domains
• Arrival time for the fastest among $N$ switching stochastic particles
• Modeling and asymptotic analysis of the concentration difference in a nanoregion between an influx and outflux diffusion across narrow windows
• Diffusive coupling facilitates and impedes noise-induced escape in interacting bistable elements
• How large should be the redundant numbers of copy to make a rare event probable
• Rare Events and Redundancy in Random Walkers Target Search in a Finite Domain
• Encounter-based approach to target search problems: a review