Random walk and trapping processes on scale-free networks

Abstract

In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the survival probability on a network with a concentration $c$ of static traps. We show that the random walkers remain close to their origin, but cover a large part of the network at the same time. This behavior is markedly different than usual random walk processes in the literature. For the trapping problem we numerically compute $\Phi (n,c)$, the survival probability of mobile species at time $n$, as a function of the concentration of trap nodes, $c$. Comparison of our results to the Rosenstock approximation indicate that this is an adequate description for networks with $2<\gamma <3$ and yield an exponential decay. For $\gamma >3$ the behavior is more complicated and one needs to employ a truncated cumulant expansion.

8 pages, 5 figures

Cited by in corpus (30)

• Random walks and diffusion on networks
• Random walks and search in time-varying networks
• Transport on Complex Networks: Flow, Jamming and Optimization
• Anomalous Transport in Complex Networks
• Random walks on complex trees
• Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees
• Trapping in complex networks
• Ring structures and mean first passage time in networks
• Effective target arrangement in a deterministic scale-free graph
• Walks on Apollonian networks
• Walks on weighted networks
• Diffusion in scale-free networks with annealed disorder
• Impact of degree heterogeneity on the behavior of trapping in Koch networks
• Coherent exciton transport and trapping on long-range interacting cycles
• Self-organizing social hierarchies on scale-free networks
• Transport of multiple users in complex networks
• Multitarget search on complex networks: A logarithmic growth of global mean random cover time
• The Gradient Mechanism in a Communication Network
• Inter-arrival times of message propagation on directed networks
• Anomalous electrical and frictionless flow conductance in complex networks
• Analytical results for the distribution of cover times of random walks on random regular graphs
• Symmetry and localization of quantum walk induced by extra link in cycles
• Characteristics of reaction-diffusion on scale-free networks
• Fractional dynamics on circulant multiplex networks: optimal coupling and long-range navigation for continuous-time random walks
• Static Pairwise Annihilation in Complex Networks
• Using complex networks to model 2-D and 3-D soil porous architecture
• Efficiency of message transmission using biased random walks in complex networks in the presence of traps
• Markov chain approach to anomalous diffusion on Newman-Watts networks
• Superdiffusion on complex networks: the role of shortcuts and long-range interactions
• Displacement of transport processes on networked topologies