Vertex overload breakdown in evolving networks

被引:256
作者
Holme, P [1 ]
Kim, BJ
机构
[1] Umea Univ, Dept Theoret Phys, S-90187 Umea, Sweden
[2] Ajou Univ, Dept Mol Sci & Technol, Suwon 442749, South Korea
关键词
D O I
10.1103/PhysRevE.65.066109
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
We study evolving networks based on the Barabasi-Albert scale-free network model with vertices sensitive to overload breakdown. The load of a vertex is defined as the betweenness centrality of the vertex. Two cases of load limitation are considered, corresponding to the fact that the average number of connections per vertex is increasing with the network's size ("extrinsic communication activity"), or that it is constant ("intrinsic communication activity"). Avalanchelike breakdowns for both load limitations are observed. In order to avoid such avalanches we argue that the capacity of the vertices has to grow with the size of the system. An interesting irregular dynamics of the formation of the giant component (for the intrinsic communication activity case) is also studied. Implications on the growth of the Internet are discussed.
引用
收藏
页数:8
相关论文
共 36 条
  • [1] Topology of evolving networks:: Local events and universality
    Albert, R
    Barabási, AL
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (24) : 5234 - 5237
  • [2] Internet -: Diameter of the World-Wide Web
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 1999, 401 (6749) : 130 - 131
  • [3] Classes of small-world networks
    Amaral, LAN
    Scala, A
    Barthélémy, M
    Stanley, HE
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (21) : 11149 - 11152
  • [4] Anthonisse J.M, 1971, 971 BN
  • [5] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [6] A faster algorithm for betweenness centrality
    Brandes, U
    [J]. JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) : 163 - 177
  • [7] Graph structure in the Web
    Broder, A
    Kumar, R
    Maghoul, F
    Raghavan, P
    Rajagopalan, S
    Stata, R
    Tomkins, A
    Wiener, J
    [J]. COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6): : 309 - 320
  • [8] Network robustness and fragility: Percolation on random graphs
    Callaway, DS
    Newman, MEJ
    Strogatz, SH
    Watts, DJ
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (25) : 5468 - 5471
  • [9] Breakdown of the internet under intentional attack
    Cohen, R
    Erez, K
    ben-Avraham, D
    Havlin, S
    [J]. PHYSICAL REVIEW LETTERS, 2001, 86 (16) : 3682 - 3685
  • [10] ERDOS P, 1960, B INT STATIST INST, V38, P343