Logarithmic growth dynamics in software networks
| dc.creator | Valverde, Sergi | |
| dc.creator | Sole, Ricard V. | |
| dc.date | 2005-11-07 | |
| dc.date.accessioned | 2026-07-07T06:52:15Z | |
| dc.date.available | 2026-07-07T06:52:15Z | |
| dc.description | 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. | |
| dc.description | 7 pages, 3 figures, published in Europhysics Letters (2005) | |
| dc.identifier | https://arxiv.org/abs/physics/0511064 | |
| dc.identifier | http://arxiv.org/abs/physics/0511064 | |
| dc.identifier | Europhys. Lett. 72 (5) (2005) | |
| dc.identifier | doi:10.1209/epl/i2005-10314-9 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/105243 | |
| dc.subject | Physics and Society | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Software Engineering | |
| dc.title | Logarithmic growth dynamics in software networks | |
| dc.type | text |