From single-particle stochastic kinetics to macroscopic reaction rates: fastest first-passage time of $N$ random walkers
Denis S. Grebenkov, Ralf Metzler, and Gleb Oshanin

TL;DR
This paper derives explicit formulas and analyzes the distribution of the fastest first-passage time for multiple diffusing particles reaching a target, revealing a strong initial condition dependence and implications for molecular reactions.
Contribution
It provides the first explicit formulas for the moments and distribution of the fastest first-passage time for multiple particles in a bounded domain, highlighting the impact of initial conditions.
Findings
Fastest first-passage time scales as 1/N and 1/N^2 for partial and perfect reactions.
Initial conditions significantly influence the scaling of the fastest first-passage time.
Analytic solutions, scaling arguments, and simulations validate the results.
Abstract
We consider the first-passage problem for identical independent particles that are initially released uniformly in a finite domain and then diffuse toward a reactive area , which can be part of the outer boundary of or a reaction centre in the interior of . For both cases of perfect and partial reactions, we obtain the explicit formulas for the first two moments of the fastest first-passage time (fFPT), i.e., the time when the first out of the particles reacts with . Moreover, we investigate the full probability density of the fFPT. We discuss a significant role of the initial condition in the scaling of the average fastest first-passage time with the particle number , namely, a much stronger dependence ( and for partially and perfectly reactive targets, respectively), in contrast to the well known inverse-logarithmic…
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.
