由度数增加和减少机制驱动的网络建模
Evolving Network Modeling Driven by the Degree Increase and Decrease Mechanism
AI总结:
本文提出了一种由顶点度数增加和减少机制驱动的网络演化模型,通过构建排队系统实现网络动态演变,并验证了其在实际网络中的有效性。
摘要:
自从巴博萨-阿尔伯特(BA)无标度网络被提出以来,网络建模一直以网络增长和优先附着(PA)为核心进行研究。然而,许多实际系统具有动态演变特征,包括网络缩减和网络增长。在本文中,我们从顶点度数的角度提出了一种新的网络演化的机制。我们构建了一个排队系统来描述顶点度数的增加和减少,从而驱动网络演变。在我们的机制中,度数增加率被视为与顶点度数正相关的函数,以新的方式确保优先附着。在两种度数增加率表达式下研究了度数分布,其中一种表现出“长尾”,另一种则随参数值变化而变化。在模拟中,我们将理论分布与模拟结果进行比较,并将其应用于实际网络,这展示了我们模型的有效性和适用性。
英文摘要:
Ever since the Barabási-Albert (BA) scale-free network has been proposed, network modeling has been studied intensively in light of the network growth and the preferential attachment (PA). However, numerous real systems are featured with a dynamic evolution including network reduction in addition to network growth. In this paper, we propose a novel mechanism for evolving networks from the perspective of vertex degree. We construct a queueing system to describe the increase and decrease of vertex degree, which drives the network evolution. In our mechanism, the degree increase rate is regarded as a function positively correlated to the degree of a vertex, ensuring the preferential attachment in a new way. Degree distributions are investigated under two expressions of the degree increase rate, one of which manifests a ``long tail'', and another one varies with different values of parameters. In simulations, we compare our theoretical distributions with simulation results and also apply them to real networks, which presents the validity and applicability of our model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。