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

Alessandro P.S. de Moura, Ying-Cheng Lai, Adilson E. Motter

Research output: Contribution to journalArticle

1 Citation (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 (US)
Number of pages1
JournalPhysical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
Volume68
Issue number1
DOIs
StatePublished - Jan 1 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

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Statistics and Probability
  • Condensed Matter Physics

Cite this

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

In: Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, Vol. 68, No. 1, 01.01.2003.

Research output: Contribution to journalArticle

@article{7524a02d5ed241f284cde3cfbc2cf778,
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.",
author = "{de Moura}, {Alessandro P.S.} and Ying-Cheng Lai and Motter, {Adilson E.}",
year = "2003",
month = "1",
day = "1",
doi = "10.1103/PhysRevE.68.017102",
language = "English (US)",
volume = "68",
journal = "Physical Review E - Statistical, Nonlinear, and Soft Matter Physics",
issn = "1539-3755",
publisher = "American Physical Society",
number = "1",

}

TY - JOUR

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

AU - de Moura, Alessandro P.S.

AU - Lai, Ying-Cheng

AU - Motter, Adilson E.

PY - 2003/1/1

Y1 - 2003/1/1

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.

UR - http://www.scopus.com/inward/record.url?scp=85035231382&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85035231382&partnerID=8YFLogxK

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

ER -