Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks

Abstract

Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)\sim k^{-\gamma }$, where the degree exponent $\gamma$ describes the extent of heterogeneity. In this paper, we study analytically the average path length (APL) of and random walks (RWs) on a family of deterministic networks, recursive scale-free trees (RSFTs), with negative degree correlations and various $\gamma \in (2,1+\frac{\ln 3}{\ln 2}]$, with an aim to explore the impacts of structure heterogeneity on APL and RWs. We show that the degree exponent $\gamma$ has no effect on APL $d$ of RSFTs: In the full range of $\gamma$, $d$ behaves as a logarithmic scaling with the number of network nodes $N$ (i.e. $d\sim \ln N$), which is in sharp contrast to the well-known double logarithmic scaling ($d\sim \ln \ln N$) previously obtained for uncorrelated scale-free networks with $2\le \gamma <3$. In addition, we present that some scaling efficiency exponents of random walks are reliant on degree exponent $\gamma$.

The definitive verion published in Journal of Mathematical Physics

References in corpus (10)

• Evolutionary games on graphs
• First-passage times in complex scale-invariant media
• Scaling theory of transport in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
• Random walks on complex trees
• Evolving small-world scale-free networks consist of cliques
• Transition from fractal to non-fractal scalings in growing scale-free networks
• Random walks and diameter of finite scale-free networks
• Border trees of complex networks

Cited by in corpus (4)

• Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Anomalous behavior of trapping on a fractal scale-free network
• Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks