Evolving Network Modeling Driven by the Degree Increase and Decrease Mechanism
提出一种基于顶点度数增减的排队系统来驱动网络演化，用新的方式实现优先连接，并验证了模型在真实网络中的有效性。
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 article, 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 PA 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.