The impact of connection density on scale-free distribution in random networks

被引:10
|
作者
Yang, Xu-Hua [1 ]
Chen, Guang [1 ]
Chen, Sheng-Yong [2 ]
机构
[1] Zhejiang Univ Technol, Coll Comp Sci & Technol, Hangzhou 310023, Zhejiang, Peoples R China
[2] Univ Cambridge, Dept Radiol, Cambridge CB2 0SP, England
基金
中国国家自然科学基金;
关键词
Scale-free network; Self-organized; Non-growth; Connection density; COMPLEX; BEHAVIOR; SYSTEMS;
D O I
10.1016/j.physa.2013.01.038
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Preferential attachment is considered as a fundamental mechanism that contributes to the scale-free characteristics of random networks, which include growth and non-growth networks. There exist some situations of non-growth random networks, particularly for very sparse or dense networks, where preferential attachments cannot consequentially result in true scale-free features, but only in scale-free-like appearances. This phenomenon implies that, a close relationship exists between the connection density p and the scaling. In this study, we propose a self-organized model with constant network size to study the phenomenon. We show analytically and numerically that there exists a certain critical point p(c). Only when p = p(c), the random network evolves into steady scale-free state. Otherwise, the network exhibits a steady scale-free-like state. The closer the p approximates p(c), the closer the scale-free-like distribution approximates the true scale-free distribution. Our results show that, in random network lack of growth, a preferential scheme does not necessarily lead to a scale-free state, and a formation of scale-free is a consequence of two mechanisms: (i) a preferential scheme and (ii) appropriate connection density. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:2547 / 2554
页数:8
相关论文
共 50 条
  • [21] Tutte Polynomial of Scale-Free Networks
    Hanlin Chen
    Hanyuan Deng
    Journal of Statistical Physics, 2016, 163 : 714 - 732
  • [22] A thermostatistical approach to scale-free networks
    da Cruz, Joao P.
    Araujo, Nuno A. M.
    Raischel, Frank
    Lind, Pedro G.
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2015, 26 (06):
  • [23] Tutte Polynomial of Scale-Free Networks
    Chen, Hanlin
    Deng, Hanyuan
    JOURNAL OF STATISTICAL PHYSICS, 2016, 163 (04) : 714 - 732
  • [24] ROBUSTNESS OF SCALE-FREE SPATIAL NETWORKS
    Jacob, Emmanuel
    Morters, Peter
    ANNALS OF PROBABILITY, 2017, 45 (03) : 1680 - 1722
  • [25] Bifractality of fractal scale-free networks
    Yamamoto, Jun
    Yakubo, Kousuke
    PHYSICAL REVIEW E, 2023, 108 (02)
  • [26] Scale-Free Networks: A Decade and Beyond
    Barabasi, Albert-Laszlo
    SCIENCE, 2009, 325 (5939) : 412 - 413
  • [27] Scale-free networks without growth
    Xie, Yan-Bo
    Zhou, Tao
    Wang, Bing-Hong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2008, 387 (07) : 1683 - 1688
  • [28] OPTIMAL ROBUSTNESS OF SCALE-FREE NETWORKS
    Zhang, Jianhua
    Cai, Yunze
    Xu, Xiaoming
    3RD INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND COMPUTER SCIENCE (ITCS 2011), PROCEEDINGS, 2011, : 138 - 141
  • [29] Software Engineering and Scale-Free Networks
    Wen, Lian
    Dromey, R. Geoff
    Kirk, Diana
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (03): : 648 - 657
  • [30] Software Engineering and Scale-Free Networks
    Wen, Lian
    Dromey, R. Geoff
    Kirk, Diana
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (04): : 845 - 854