Logarithmic growth dynamics in software networks
<|reference_start|>Logarithmic growth dynamics in software networks: In a recent paper, Krapivsky and Redner (Phys. Rev. E, 71 (2005) 036118) proposed a new growing network model with new nodes being attached to a randomly selected node, as well to all ancestors of the target node. The model leads to a sparse graph with an average degree growing logarithmically with the system size. Here we present compeling evidence for software networks being the result of a similar class of growing dynamics. The predicted pattern of network growth, as well as the stationary in- and out-degree distributions are consistent with the model. Our results confirm the view of large-scale software topology being generated through duplication-rewiring mechanisms. Implications of these findings are outlined.<|reference_end|>
@article{valverde2005logarithmic,
    title={Logarithmic growth dynamics in software networks},
    author={Sergi Valverde, Ricard V. Sole},
    journal={Europhys. Lett. 72 (5) (2005)},
    year={2005},
    doi={10.1209/epl/i2005-10314-9},
    archivePrefix={arXiv},
    eprint={physics/0511064},
    primaryClass={physics.soc-ph cond-mat.dis-nn cs.SE}
}