Logarithmic growth dynamics in software networks

Physics – Physics and Society

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 3 figures, published in Europhysics Letters (2005)

Scientific paper

10.1209/epl/i2005-10314-9

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Logarithmic growth dynamics in software networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logarithmic growth dynamics in software networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logarithmic growth dynamics in software networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-336731

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.