Learn More
An increasing number of experimental studies employ single particle tracking to probe the physical environment in complex systems. We here propose and discuss what we believe are new methods to analyze the time series of the particle traces, in particular, for subdiffusion phenomena. We discuss the statistical properties of mean maximal excursions (MMEs),(More)
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 over the past decade. The importance of FPTs originates from the crucial role played by first encounter properties in various real situations, including transport in disordered(More)
Subdiffusive motion of tracer particles in complex crowded environments, such as biological cells, has been shown to be widespread. This deviation from Brownian motion is usually characterized by a sublinear time dependence of the mean square displacement (MSD). However, subdiffusive behavior can stem from different microscopic scenarios that cannot be(More)
Combining extensive single particle tracking microscopy data of endogenous lipid granules in living fission yeast cells with analytical results we show evidence for anomalous diffusion and weak ergodicity breaking. Namely we demonstrate that at short times the granules perform subdiffusion according to the laws of continuous time random walk theory. The(More)
We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium(More)
We consider a minimal model of persistent random searcher with a short range memory. We calculate exactly for such a searcher the mean first-passage time to a target in a bounded domain and find that it admits a nontrivial minimum as function of the persistence length. This reveals an optimal search strategy which differs markedly from the simple ballistic(More)
In this Letter, we develop an analytical approach which provides an explicit determination of mean first-passage times (MFPTs) for random walks in bounded domains for a wide class of transport processes. In particular, we derive for the first time explicit expressions of MFPTs for emblematic models of transport in complex media, such as diffusion on(More)
We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained distribution is exact and completely explicit in the case or parallelepipedic confining domains. We discuss implications(More)
We develop an analytical approach that provides the dependence of the mean first-passage time (MFPT) for random walks on complex networks both on the target connectivity and on the source-target distance. Our approach puts forward two strongly different behaviors depending on the type-compact or non compact-of the random walk. In the case of non compact(More)
We introduce a general framework, applicable to a broad class of random walks on networks, that quantifies the response of the mean first-passage time to a target node to a local perturbation of the network, both in the context of attacks (damaged link) or strategies of transport enhancement (added link). This approach enables to determine explicitly the(More)