Signatures of small-world and scale-free properties in large computer programs
<|reference_start|>Signatures of small-world and scale-free properties in large computer programs: 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.<|reference_end|>
@article{de moura2003signatures,
    title={Signatures of small-world and scale-free properties in large computer
  programs},
    author={Alessandro P. S. de Moura, Ying-Cheng Lai, and Adilson E. Motter},
    journal={Phys. Rev. E 68, 017102 (2003)},
    year={2003},
    doi={10.1103/PhysRevE.68.017102},
    archivePrefix={arXiv},
    eprint={cond-mat/0306609},
    primaryClass={cond-mat.dis-nn cs.GL}
}