Laplacian spectra of, and random walks on, complex networks: Are scale-free architectures really important?

被引:79
|
作者
Samukhin, A. N. [1 ,2 ]
Dorogovtsev, S. N. [1 ,2 ]
Mendes, J. F. F. [1 ]
机构
[1] Univ Aveiro, Dept Fis, P-3810193 Aveiro, Portugal
[2] AF Ioffe Phys Tech Inst, St Petersburg 194021, Russia
关键词
D O I
10.1103/PhysRevE.77.036115
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
We study the Laplacian operator of an uncorrelated random network and, as an application, consider hopping processes (diffusion, random walks, signal propagation, etc.) on networks. We develop a strict approach to these problems. We derive an exact closed set of integral equations, which provide the averages of the Laplacian operator's resolvent. This enables us to describe the propagation of a signal and random walks on the network. We show that the determining parameter in this problem is the minimum degree q(m) of vertices in the network and that the high-degree part of the degree distribution is not that essential. The position of the lower edge of the Laplacian spectrum lambda(c) appears to be the same as in the regular Bethe lattice with the coordination number qm. Namely, lambda(c) > 0 if q(m) > 2, and lambda(c) = 0 if q(m) <= 2. In both of these cases the density of eigenvalues rho(lambda) --> 0 as lambda --> lambda(c) + 0, but the limiting behaviors near lambda(c) are very different. In terms of a distance from a starting vertex, the hopping propagator is a steady moving Gaussian, broadening with time. This picture qualitatively coincides with that for a regular Bethe lattice. Our analytical results include the spectral density rho(lambda) near lambda(c) and the long-time asymptotics of the autocorrelator and the propagator.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Random walks and diameter of finite scale-free networks
    Lee, Sungmin
    Yook, Soon-Hyung
    Kim, Yup
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2008, 387 (12) : 3033 - 3038
  • [2] Role of fractal dimension in random walks on scale-free networks
    Zhongzhi Zhang
    Yihang Yang
    Shuyang Gao
    The European Physical Journal B, 2011, 84 : 331 - 338
  • [3] Return probability for random walks on scale-free complex trees
    Chelminiak, Przemyslaw
    PHYSICS LETTERS A, 2011, 375 (35) : 3114 - 3118
  • [4] Random walks in modular scale-free networks with multiple traps
    Zhang, Zhongzhi
    Yang, Yihang
    Lin, Yuan
    PHYSICAL REVIEW E, 2012, 85 (01)
  • [5] Role of fractal dimension in random walks on scale-free networks
    Zhang, Zhongzhi
    Yang, Yihang
    Gao, Shuyang
    EUROPEAN PHYSICAL JOURNAL B, 2011, 84 (02): : 331 - 338
  • [6] Random walks on deterministic scale-free networks: Exact results
    Agliari, E.
    Burioni, R.
    PHYSICAL REVIEW E, 2009, 80 (03):
  • [7] Influence of weight heterogeneity on random walks in scale-free networks
    Li, Ling
    Guan, Jihong
    Qi, Zhaohui
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2016, 49 (27)
  • [8] Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
    Shang, Yilun
    INTERNET MATHEMATICS, 2012, 8 (04) : 321 - 337
  • [9] Biased random walks in the scale-free networks with the disassortative degree correlation
    Hu Yao-Guang
    Wang Sheng-Jun
    Jin Tao
    Qu Shi-Xian
    ACTA PHYSICA SINICA, 2015, 64 (02)
  • [10] Random walks in unweighted and weighted modular scale-free networks with a perfect trap
    Yang, Yihang
    Zhang, Zhongzhi
    JOURNAL OF CHEMICAL PHYSICS, 2013, 139 (23):