Influences of degree inhomogeneity on average path length and random walks in disassortativ.pdfVIP

Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks 1,2 ∗ 3 1,2 † 1,2 3 Zhongzhi Zhang , Yichao Zhang , Shuigeng Zhou , Ming Yin , and Jihong Guan 1School of Computer Science, Fudan University, Shanghai 200433, China 2Shanghai Key Lab of Intelligent Information Processing, Fudan University, Shanghai 200433, China and 3Department of Computer Science and Technology, Tongji University, 4800 Cao’an Road, Shanghai 201804, China (Dated: September 16, 2008) Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter 8 being characterized by power-law degree distribution P (k) ∼ k−γ , where the degree exponent γ 0 describes the extent of heterogeneity. In this paper, we study analytically the average path length 0 (APL) of and random walks (RWs) on a family of deterministic networks, recursive scale-free trees 2 ln3 (RSFTs), with negative degree correlations and various γ ∈ (2, 1 + ln2 ], with an aim to explore the p impacts of structure heterogeneity on APL and RWs. We show that the degree exponent γ has no e effect on APL d of RSFTs: In the full range of γ , d behaves as a logarithmic scaling with the number S