Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.10808 v1 pith:CJWSIA2T submitted 2018-04-28 cond-mat.stat-mech physics.data-an

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

classification cond-mat.stat-mech physics.data-an
keywords arrivalassociatedescapefastestnarrowtrajectorieswindowbrownian
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.