Statistical properties and attack tolerance of growing networks with algebraic preferential attachment

Z H Liu, Y C Lai, N Ye, Ying-Cheng Lai

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

We consider growing networks with algebraic preferential attachment and address two questions: (1) what is the effect of temporal fluctuations in the number of new links acquired by the network? and (2) what is the network tolerance against random failures and intentional attacks? We find that the fluctuations generally have little effect on the network properties, although they lead to a plateau behavior for small degrees in the connectivity distribution. Formulas are derived for the evolution and distribution of the network connectivity, which are tested by numerical simulations. Numerical study of the effect of failures and attacks suggests that networks constructed under algebraic preferential attachment are more robust than scale-free networks.

Original languageEnglish
Article number036112
Pages (from-to)-
Number of pages7
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume66
Issue number3
DOIs
Publication statusPublished - Sep 2002

Keywords

  • WORLD-WIDE-WEB
  • EVOLVING NETWORKS
  • COMPLEX NETWORKS
  • INTERNET
  • TOPOLOGY
  • DYNAMICS

Cite this

Statistical properties and attack tolerance of growing networks with algebraic preferential attachment. / Liu, Z H ; Lai, Y C ; Ye, N ; Lai, Ying-Cheng.

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 66, No. 3, 036112, 09.2002, p. -.

Research output: Contribution to journalArticle

@article{bf8fbdef7fc04c65962b6bdd8268d4f4,
title = "Statistical properties and attack tolerance of growing networks with algebraic preferential attachment",
abstract = "We consider growing networks with algebraic preferential attachment and address two questions: (1) what is the effect of temporal fluctuations in the number of new links acquired by the network? and (2) what is the network tolerance against random failures and intentional attacks? We find that the fluctuations generally have little effect on the network properties, although they lead to a plateau behavior for small degrees in the connectivity distribution. Formulas are derived for the evolution and distribution of the network connectivity, which are tested by numerical simulations. Numerical study of the effect of failures and attacks suggests that networks constructed under algebraic preferential attachment are more robust than scale-free networks.",
keywords = "WORLD-WIDE-WEB, EVOLVING NETWORKS, COMPLEX NETWORKS, INTERNET, TOPOLOGY, DYNAMICS",
author = "Liu, {Z H} and Lai, {Y C} and N Ye and Ying-Cheng Lai",
year = "2002",
month = "9",
doi = "10.1103/PhysRevE.66.036112",
language = "English",
volume = "66",
pages = "--",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "3",

}

TY - JOUR

T1 - Statistical properties and attack tolerance of growing networks with algebraic preferential attachment

AU - Liu, Z H

AU - Lai, Y C

AU - Ye, N

AU - Lai, Ying-Cheng

PY - 2002/9

Y1 - 2002/9

N2 - We consider growing networks with algebraic preferential attachment and address two questions: (1) what is the effect of temporal fluctuations in the number of new links acquired by the network? and (2) what is the network tolerance against random failures and intentional attacks? We find that the fluctuations generally have little effect on the network properties, although they lead to a plateau behavior for small degrees in the connectivity distribution. Formulas are derived for the evolution and distribution of the network connectivity, which are tested by numerical simulations. Numerical study of the effect of failures and attacks suggests that networks constructed under algebraic preferential attachment are more robust than scale-free networks.

AB - We consider growing networks with algebraic preferential attachment and address two questions: (1) what is the effect of temporal fluctuations in the number of new links acquired by the network? and (2) what is the network tolerance against random failures and intentional attacks? We find that the fluctuations generally have little effect on the network properties, although they lead to a plateau behavior for small degrees in the connectivity distribution. Formulas are derived for the evolution and distribution of the network connectivity, which are tested by numerical simulations. Numerical study of the effect of failures and attacks suggests that networks constructed under algebraic preferential attachment are more robust than scale-free networks.

KW - WORLD-WIDE-WEB

KW - EVOLVING NETWORKS

KW - COMPLEX NETWORKS

KW - INTERNET

KW - TOPOLOGY

KW - DYNAMICS

U2 - 10.1103/PhysRevE.66.036112

DO - 10.1103/PhysRevE.66.036112

M3 - Article

VL - 66

SP - -

JO - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

JF - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

SN - 1539-3755

IS - 3

M1 - 036112

ER -