activity
19992014
most citedLévy walks

770 citations · 5.2k across the 56 of their papers we have counts for

collaborators
Showing 2007Show all

9 papers · 1 filter

cond-mat.stat-mech2007★ 631 cited

First-passage times in complex scale-invariant media

S. Condamin, O. Benichou, V. Tejedor +2

How long does it take a random walker to reach a given target point? This quantity, known as a first passage time (FPT), has led to a growing number of theoretical investigations o…

cond-mat.stat-mech2007★ 16 cited

Number of distinct sites visited by a subdiffusive random walker

Santos Bravo Yuste, J. Klafter, Katja Lindenberg

The asymptotic mean number of distinct sites visited by a subdiffusive continuous time random walker in two dimensions seems not to have been explicitly calculated anywhere in the…

cond-mat.stat-mech2007★ 4 cited

The advantage of Lévy strategies in intermittent search processes

Michael A. Lomholt, Tal Koren, Ralf Metzler +1

Search strategies based on random walk processes with long-tailed jump length distributions (Levy walks) on the one hand and intermittent behavior switching between local search an…

cond-mat.stat-mech2007★ 150 cited

Leapover lengths and first passage time statistics for Lévy flights

Tal Koren, Michael A. Lomholt, Aleksei V. Chechkin +2

Exact results for the first passage time and leapover statistics of symmetric and one-sided Levy flights (LFs) are derived. LFs with stable index alpha are shown to have leapover l…

cond-mat.stat-mech2007

Lévy Statistics and Anomalous Transport: Lévy flights and Subdiffusion

Ralf Metzler, Aleksei V. Chechkin, Joseph Klafter

Levy flights and subdiffusive processes and their properties are discussed. We derive the space- and time-fractional transport equations, and consider their solutions in external p…

cond-mat.soft2007★ 29 cited

Closed-form solutions for continuous time random walks on finite chains

Ophir Flomenbom, Joseph Klafter

Continuous time random walks (CTRW) on finite arbitrarily inhomogeneous chains are studied. By introducing a technique of counting all possible trajectories, we derive closed-form…