Response to targeted perturbations for random walks on networks

Abstract

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 dependence of this response on geometric parameters (such as the network size and the localization of the perturbation) and on the intensity of the perturbation. In particular, it is showed that the relative variation of the MFPT is independent of the network size, and remains significant in the large size limit. Furthermore, in the case of non compact exploration of the network, it is found that a targeted perturbation keeps a substantial impact on transport properties for any localization of the damaged link.

4 pages, 4 figures

References in corpus (21)

• Statistical mechanics of complex networks
• Epidemic spreading in scale-free networks
• Catastrophic cascade of failures in interdependent networks
• Critical phenomena in complex networks
• Self-similarity of complex networks
• First-passage times in complex scale-invariant media
• Origins of fractality in the growth of complex networks
• Halting viruses in scale-free networks
• Geometry-controlled kinetics
• Optimal search strategies for hidden targets
• Dynamic Effects Increasing Network Vulnerability to Cascading Failures
• Scaling theory of transport in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Global mean first-passage times of random walks on complex networks
• First-passage times for random walks in bounded domains
• How to make a fragile network robust and vice versa
• Exact solution for mean first-passage time on a pseudofractal scale-free web
• Occupation times of random walks in confined geometries: From random trap model to diffusion limited reactions
• Random Walks on deterministic Scale-Free networks: Exact results
• Random walks on complex trees
• On the Plants Leaves Boundary, "Jupe à Godets" and Conformal Embeddings

Cited by in corpus (2)

• Non-Gaussianity and Dynamical Trapping in Locally Activated Random Walks
• Characterizing network topology using first-passage analysis