First-passage times in complex scale-invariant media

Abstract

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 last decade1. The importance of FPTs originates from the crucial role played by first encounter properties in various real situations, including transport in disordered media, neuron firing dynamics, spreading of diseases or target search processes. Most methods to determine the FPT properties in confining domains have been limited to effective 1D geometries, or for space dimensions larger than one only to homogeneous media1. Here we propose a general theory which allows one to accurately evaluate the mean FPT (MFPT) in complex media. Remarkably, this analytical approach provides a universal scaling dependence of the MFPT on both the volume of the confining domain and the source-target distance. This analysis is applicable to a broad range of stochastic processes characterized by length scale invariant properties. Our theoretical predictions are confirmed by numerical simulations for several emblematic models of disordered media, fractals, anomalous diffusion and scale free networks.

Submitted version. Supplementary Informations available on Nature website

References in corpus (1)

• Scaling theory of transport in complex networks

Cited by in corpus (24)

• Understanding individual human mobility patterns
• Probing microscopic origins of confined subdiffusion by first-passage observables
• Exact mean first-passage time on the T-graph
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
• Random walks on complex trees
• Exact solution of mean geodesic distance for Vicsek fractals
• Random walks on the Apollonian network with a single trap
• Effects of intersegmental transfers on target location by proteins
• Mean first-passage time for random walks on the T-graph
• Fractal scale-free networks resistant to disease spread
• Average distance in a hierarchical scale-free network: an exact solution
• Quantifying intermittent transport in cell cytoplasm
• Comment on "Localization Transition of Biased Random Walks on Random Networks"
• Transport in networks with multiple sources and sinks
• Anomalous behavior of trapping on a fractal scale-free network
• Anomalous Diffusion on the Hanoi Networks
• Glass transition and random walks on complex energy landscapes
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• The Spectrum of the Fractional Laplacian and First Passage Time Statistics
• Geometry and Dynamics for Hierarchical Regular Networks
• How rare are diffusive rare events?
• Universal Spectra of Coherent Atoms in a Recurrent Random Walk
• Generalisation of the fractal Einstein law relating conduction and diffusion on networks