软件网络中的对数增长动力学
Logarithmic growth dynamics in software networks
摘要：
在最近的一篇论文中，Krapivsky和Redner（Phys.Rev.E，71（2005）036118）提出了一种新的增长网络模型，其中新节点被附加到随机选择的节点以及目标节点的所有祖先。该模型导致了一个稀疏的图，平均度随系统规模的增长而增长。在这里，我们提出了有力的证据，证明软件网络是类似的增长动力的结果。预测的网络增长模式，以及固定的入度和出度分布与模型一致。我们的研究结果证实了大规模的软件拓扑结构通过复制重新布线机制产生的观点。这些研究结果的影响进行了概述。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
