增长网络的承载能力
Carrying capacity in growing networks
摘要：
本文研究了一个能在无限时间内生成有限度随机网络的增长网络模型。的动态是由一个规则，在人口增长的背景下，类似于马尔萨斯-Verhulst模型的计划下的程度增加。通过一些精确的结果和模拟，在静态和时间依赖的制度的度分布进行了分析，并发现在渐近大时间的标度行为。对于有限时间，依赖于时间的度分布显示了一个聚集的枢纽，作为连接概率中吸引项和排斥项之间竞争的结果。
英文摘要：
In this work, a growing network model that can generate a random network with finite degree in infinite time is studied. The dynamics are governed by a rule where the degree increases under a scheme similar to the Malthus-Verhulst model in the context of population growth. The degree distribution is analysed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time. For finite times, the time-dependent degree distribution displays an accumulation of hubs as a result of competition between attractive and repulsive terms in linking probability.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
