Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence

Abstract

In general, the power-law degree distribution has profound influence on various dynamical processes defined on scale-free networks. In this paper, we will show that power-law degree distribution alone does not suffice to characterize the behavior of trapping problem on scale-free networks, which is an integral major theme of interest for random walks in the presence of an immobile perfect absorber. In order to achieve this goal, we study random walks on a family of one-parameter (denoted by $q$) scale-free networks with identical degree sequence for the full range of parameter $q$, in which a trap is located at a fixed site. We obtain analytically or numerically the mean first-passage time (MFPT) for the trapping issue. In the limit of large network order (number of nodes), for the whole class of networks, the MFPT increases asymptotically as a power-law function of network order with the exponent obviously different for different parameter $q$, which suggests that power-law degree distribution itself is not sufficient to characterize the scaling behavior of MFPT for random walks, at least trapping problem, performed on scale-free networks.

9 pages, 10 figures

References in corpus (14)

• First-passage times in complex scale-invariant media
• Fractal and Transfractal Recursive Scale-Free Nets
• Exact mean first-passage time on the T-graph
• 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
• Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
• Random Walks on deterministic Scale-Free networks: Exact results
• Percolation in Hierarchical Scale-Free Nets
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Random walks on the Apollonian network with a single trap
• Fractal scale-free networks resistant to disease spread
• Different thresholds of bond percolation in scale-free networks with identical degree sequence
• Transition from fractal to non-fractal scalings in growing scale-free networks
• Chaotic Spin Correlations in Frustrated Ising Hierarchical Lattices

Cited by in corpus (17)

• Random walks on weighted networks
• Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices
• Exact calculations of first-passage quantities on recursive networks
• Determining mean first-passage time on a class of treelike regular fractals
• Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
• Mean first-passage time for random walks on undirected networks
• Influence of trap location on the efficiency of trapping in dendrimers and regular hyperbranched polymers
• Random walks in modular scale-free networks with multiple traps
• Role of fractal dimension in random walks on scale-free networks
• Mean first-passage time for random walks in general graphs with a deep trap
• Complete spectrum of stochastic master equation for random walks on treelike fractals
• Controlling the efficiency of trapping in treelike fractals
• Origin of the hub spectral dimension in scale-free networks
• Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence
• Random walks in unweighted and weighted modular scale-free networks with a perfect trap
• Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
• Anomalous behavior of trapping in extended dendrimers with a perfect trap