From first-passage times of random walks in confinement to geometry-controlled kinetics
O Bénichou, R Voituriez - Physics Reports, 2014 - Elsevier
We present a general theory which allows one to accurately evaluate the mean first-passage
time (FPT) for regular random walks in bounded domains, and its extensions to related first …
time (FPT) for regular random walks in bounded domains, and its extensions to related first …
Hybrid asymptotic-numerical approach for estimating first-passage-time densities of the two-dimensional narrow capture problem
AE Lindsay, RT Spoonmore, JC Tzou - Physical Review E, 2016 - APS
A hybrid asymptotic-numerical method is presented for obtaining an asymptotic estimate for
the full probability distribution of capture times of a random walker by multiple small traps …
the full probability distribution of capture times of a random walker by multiple small traps …
First passage statistics for the capture of a Brownian particle by a structured spherical target with multiple surface traps
We study the first passage time problem for a diffusing molecule in an enclosed region to hit
a small spherical target whose surface contains many small absorbing traps. This study is …
a small spherical target whose surface contains many small absorbing traps. This study is …
Escape from subcellular domains with randomly switching boundaries
PC Bressloff, SD Lawley - Multiscale Modeling & Simulation, 2015 - SIAM
Motivated by various cellular transport processes, we consider diffusion in a potential and
analyze the escape time to boundaries that randomly switch between absorbing and …
analyze the escape time to boundaries that randomly switch between absorbing and …
Conditional mean first passage times to small traps in a 3-D domain with a sticky boundary: applications to T cell searching behavior in lymph nodes
Calculating the time required for a diffusing object to reach a small target within a larger
domain is a feature of a large class of modeling and simulation efforts in biology. Here, we …
domain is a feature of a large class of modeling and simulation efforts in biology. Here, we …
Extended narrow escape with many windows for analyzing viral entry into the cell nucleus
Many viruses must enter the cell nucleus through small nanopores in order to replicate. We
model here the viral motion as a stochastic process described by the Survival Fokker …
model here the viral motion as a stochastic process described by the Survival Fokker …
An iterative procedure for finding locally and globally optimal arrangements of particles on the unit sphere
WJM Ridgway, AF Cheviakov - Computer Physics Communications, 2018 - Elsevier
The problem of determination of globally optimal arrangements of N pairwise-interacting
particles arises in a variety of biological, physical, and chemical applications. At the same …
particles arises in a variety of biological, physical, and chemical applications. At the same …
Asymptotic analysis of narrow escape problems in nonspherical three-dimensional domains
D Gomez, AF Cheviakov - Physical Review E, 2015 - APS
Narrow escape problems consider the calculation of the mean first passage time (MFPT) for
a particle undergoing Brownian motion in a domain with a boundary that is everywhere …
a particle undergoing Brownian motion in a domain with a boundary that is everywhere …
Brownian dynamics simulations for the narrow escape problem in the unit sphere
V Srivastava, A Cheviakov - Physical Review E, 2021 - APS
The narrow escape problem is a first-passage problem that concerns the calculation of the
time needed for a Brownian particle to leave a domain with localized absorbing boundary …
time needed for a Brownian particle to leave a domain with localized absorbing boundary …
Counterexample to the Lévy flight foraging hypothesis in the narrow capture framework
The Lévy flight foraging hypothesis asserts that biological organisms have evolved to
employ (truncated) Lévy flight searches due to such strategies being more efficient than …
employ (truncated) Lévy flight searches due to such strategies being more efficient than …