662 citations · 2k across the 11 of their papers we have counts for
3 papers · 1 filter
Optimizing persistent random searches
V. Tejedor, R. Voituriez, O. Bénichou
We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domai…
Residual mean first-passage time for jump processes: theory and applications to Lévy flights and fractional Brownian motion
Vincent Tejedor, Olivier Bénichou, Ralf Metzler +1
We derive a functional equation for the mean first-passage time (MFPT) of a generic self-similar Markovian continuous process to a target in a one-dimensional domain and obtain its…
Close or connected? Distance and connectivity effects on transport in networks
Vincent Tejedor, Olivier Bénichou, Raphael Voituriez
We develop an analytical approach which provides the dependence of the mean first-passage time (MFPT) for random walks on complex networks both on the target connectivity and on th…