264 citations · 3.4k across the 103 of their papers we have counts for
45 papers · 1 filter
Fastest first-passage time for multiple searchers with finite speed
Denis S. Grebenkov, Ralf Metzler, Gleb Oshanin
We study analytically and numerically the mean fastest first-passage time (fFPT) to an immobile target for an ensemble of independent finite-speed random searchers driven by di…
Transport collapse in dynamically evolving networks
Geoffroy Berthelot, Liubov Tupikina, Min-Yeong Kang +2
Transport in complex networks can describe a variety of natural and human-engineered processes including biological, societal and technological ones. However, how the properties of…
Escape of a Sticky Particle
Yuval Scher, Shlomi Reuveni, Denis S. Grebenkov
Adsorption to a surface, reversible-binding, and trapping are all prevalent scenarios where particles exhibit "stickiness". Escape and first-passage times are known to be drastical…
An encounter-based approach to the escape problem
Denis S. Grebenkov
We revise the encounter-based approach to imperfect diffusion-controlled reactions, which employs the statistics of encounters between a diffusing particle and the reactive region…
Survival in a nanoforest of absorbing pillars
Denis S. Grebenkov, Alexei T. Skvortsov
We investigate the survival probability of a particle diffusing between two parallel reflecting planes toward a periodic array of absorbing pillars. We approximate the periodic cel…
Encounter-based approach to diffusion with resetting
Ziyad Benkhadaj, Denis S. Grebenkov
An encounter-based approach consists in using the boundary local time as a proxy for the number of encounters between a diffusing particle and a target to implement various surface…