Self-organized scale-free networks

Kwangho Park, Ying-Cheng Lai, N Ye

Research output: Contribution to journalArticle

57 Citations (Scopus)

Abstract

Growth and preferential attachments have been coined as the two fundamental mechanisms responsible for the scale-free feature in complex networks, as characterized by an algebraic degree distribution. There are situations, particularly in biological networks, where growth is absent or not important, yet some of these networks still exhibit the scale-free feature with a small degree exponent. Here we propose two classes of models to account for this phenomenon. We show analytically and numerically that, in the first model, a spectrum of algebraic degree distributions with a small exponent can be generated. The second model incorporates weights for nodes, and it is able to generate robust scale-free degree distribution with larger algebraic exponents. Our results imply that it is natural for a complex network to self-organize itself into a scale-free state without growth.

Original languageEnglish
Article number026131
Number of pages5
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume72
Issue number2
DOIs
Publication statusPublished - Aug 2005

Keywords

  • small-world networks
  • complex networks
  • metabolic networks
  • dynamics

Cite this

Self-organized scale-free networks. / Park, Kwangho; Lai, Ying-Cheng; Ye, N .

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 72, No. 2, 026131, 08.2005.

Research output: Contribution to journalArticle

Park, Kwangho ; Lai, Ying-Cheng ; Ye, N . / Self-organized scale-free networks. In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics. 2005 ; Vol. 72, No. 2.
@article{522a3d25c12f4981ae7262857d3cc806,
title = "Self-organized scale-free networks",
abstract = "Growth and preferential attachments have been coined as the two fundamental mechanisms responsible for the scale-free feature in complex networks, as characterized by an algebraic degree distribution. There are situations, particularly in biological networks, where growth is absent or not important, yet some of these networks still exhibit the scale-free feature with a small degree exponent. Here we propose two classes of models to account for this phenomenon. We show analytically and numerically that, in the first model, a spectrum of algebraic degree distributions with a small exponent can be generated. The second model incorporates weights for nodes, and it is able to generate robust scale-free degree distribution with larger algebraic exponents. Our results imply that it is natural for a complex network to self-organize itself into a scale-free state without growth.",
keywords = "small-world networks, complex networks, metabolic networks, dynamics",
author = "Kwangho Park and Ying-Cheng Lai and N Ye",
year = "2005",
month = "8",
doi = "10.1103/PhysRevE.72.026131",
language = "English",
volume = "72",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "2",

}

TY - JOUR

T1 - Self-organized scale-free networks

AU - Park, Kwangho

AU - Lai, Ying-Cheng

AU - Ye, N

PY - 2005/8

Y1 - 2005/8

N2 - Growth and preferential attachments have been coined as the two fundamental mechanisms responsible for the scale-free feature in complex networks, as characterized by an algebraic degree distribution. There are situations, particularly in biological networks, where growth is absent or not important, yet some of these networks still exhibit the scale-free feature with a small degree exponent. Here we propose two classes of models to account for this phenomenon. We show analytically and numerically that, in the first model, a spectrum of algebraic degree distributions with a small exponent can be generated. The second model incorporates weights for nodes, and it is able to generate robust scale-free degree distribution with larger algebraic exponents. Our results imply that it is natural for a complex network to self-organize itself into a scale-free state without growth.

AB - Growth and preferential attachments have been coined as the two fundamental mechanisms responsible for the scale-free feature in complex networks, as characterized by an algebraic degree distribution. There are situations, particularly in biological networks, where growth is absent or not important, yet some of these networks still exhibit the scale-free feature with a small degree exponent. Here we propose two classes of models to account for this phenomenon. We show analytically and numerically that, in the first model, a spectrum of algebraic degree distributions with a small exponent can be generated. The second model incorporates weights for nodes, and it is able to generate robust scale-free degree distribution with larger algebraic exponents. Our results imply that it is natural for a complex network to self-organize itself into a scale-free state without growth.

KW - small-world networks

KW - complex networks

KW - metabolic networks

KW - dynamics

U2 - 10.1103/PhysRevE.72.026131

DO - 10.1103/PhysRevE.72.026131

M3 - Article

VL - 72

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

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

SN - 1539-3755

IS - 2

M1 - 026131

ER -