Signatures of small-world and scale-free properties in large computer programs

A P S de Moura, Y C Lai, A E Motter, Ying-Cheng Lai

Research output: Contribution to journalArticle

93 Citations (Scopus)

Abstract

A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the "information flow" within the program. We show that (1) due to its growth in time this network displays a scale-free feature in that the probability of the number of links at a node obeys a power-law distribution, and (2) as a result of performance optimization of the program the network has a small-world structure. We believe that these features are generic for large computer programs. Our work extends the previous studies on growing networks, which have mostly been for physical networks, to the domain of computer software.

Original languageEnglish
Article number017102
Number of pages4
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume68
Issue number1
DOIs
Publication statusPublished - Jul 2003

Fingerprint

Small World
Signature
signatures
computer programs
Growing Networks
Performance Optimization
information flow
Power-law Distribution
Information Flow
Internal
Unit
Vertex of a graph
optimization

Keywords

  • complex networks
  • wide-web
  • evolving networks
  • growing networks
  • connectivity
  • emergence
  • dynamics
  • topology
  • physics
  • model

Cite this

Signatures of small-world and scale-free properties in large computer programs. / de Moura, A P S ; Lai, Y C ; Motter, A E ; Lai, Ying-Cheng.

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 68, No. 1, 017102, 07.2003.

Research output: Contribution to journalArticle

@article{3fa5cd128ea54a0fb7d7691775fec4ed,
title = "Signatures of small-world and scale-free properties in large computer programs",
abstract = "A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the {"}information flow{"} within the program. We show that (1) due to its growth in time this network displays a scale-free feature in that the probability of the number of links at a node obeys a power-law distribution, and (2) as a result of performance optimization of the program the network has a small-world structure. We believe that these features are generic for large computer programs. Our work extends the previous studies on growing networks, which have mostly been for physical networks, to the domain of computer software.",
keywords = "complex networks, wide-web, evolving networks, growing networks, connectivity, emergence, dynamics, topology, physics, model",
author = "{de Moura}, {A P S} and Lai, {Y C} and Motter, {A E} and Ying-Cheng Lai",
year = "2003",
month = "7",
doi = "10.1103/PhysRevE.68.017102",
language = "English",
volume = "68",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "1",

}

TY - JOUR

T1 - Signatures of small-world and scale-free properties in large computer programs

AU - de Moura, A P S

AU - Lai, Y C

AU - Motter, A E

AU - Lai, Ying-Cheng

PY - 2003/7

Y1 - 2003/7

N2 - A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the "information flow" within the program. We show that (1) due to its growth in time this network displays a scale-free feature in that the probability of the number of links at a node obeys a power-law distribution, and (2) as a result of performance optimization of the program the network has a small-world structure. We believe that these features are generic for large computer programs. Our work extends the previous studies on growing networks, which have mostly been for physical networks, to the domain of computer software.

AB - A large computer program is typically divided into many hundreds or even thousands of smaller units, whose logical connections define a network in a natural way. This network reflects the internal structure of the program, and defines the "information flow" within the program. We show that (1) due to its growth in time this network displays a scale-free feature in that the probability of the number of links at a node obeys a power-law distribution, and (2) as a result of performance optimization of the program the network has a small-world structure. We believe that these features are generic for large computer programs. Our work extends the previous studies on growing networks, which have mostly been for physical networks, to the domain of computer software.

KW - complex networks

KW - wide-web

KW - evolving networks

KW - growing networks

KW - connectivity

KW - emergence

KW - dynamics

KW - topology

KW - physics

KW - model

U2 - 10.1103/PhysRevE.68.017102

DO - 10.1103/PhysRevE.68.017102

M3 - Article

VL - 68

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

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

SN - 1539-3755

IS - 1

M1 - 017102

ER -