arXiv Analytics

Sign in

arXiv:1804.10808 [cond-mat.stat-mech]AbstractReferencesReviewsResources

Extreme Narrow Escape: shortest paths for the first particles to escape through a small window

Kanishka Basnayake, Akim Hubl, Zeev Schuss, David Holcman

Published 2018-04-28Version 1

What is the path associated with the fastest Brownian particle that reaches a narrow window located on the boundary of a domain? Although the distribution of the fastest arrival times has been well studied in dimension 1, much less is known in higher dimensions. Based on the Wiener path-integral, we derive a variational principle for the path associated with the fastest arrival particle. Specifically, we show that in a large ensemble of independent Brownian trajectories, the first moment of the shortest arrival time is associated with the minimization of the energy-action and the optimal trajectories are geodesics. Escape trajectories concentrate along these geodesics, as confirmed by stochastic simulations when an obstacle is positioned in front of the narrow window. To conclude paths in stochastic dynamics and their time scale can differ significantly from the mean properties, usually at the basis of the Smoluchowski's theory of chemical reactions.

Comments: After Narrow Escape, Here is Extreme Narrow Escape
Subjects: 60G40, G.3
Related articles: Most relevant | Search more
arXiv:cond-mat/0201083 (Published 2002-01-07)
Shortest paths on systems with power-law distributed long-range connections
arXiv:cond-mat/0203278 (Published 2002-03-13, updated 2002-05-08)
Shortest paths and load scaling in scale-free trees
The shape of shortest paths in random spatial networks