Title:

Universality of Competitive Networks in Complex Networks

Abstract: The paper proposes a model which helps to investigate the competitive aspect of real networks in quantitative terms. Through theoretical analysis and numerical simulations, it shows that the competitive model has the universality for a weighted network. The relation between parameters in the weighted network and the competitiveness in the competitive network is obtained by theoretical analysis. Based on the expression of the degree distribution of the competitive network, the strength and degree distributions of the weighted network can be calculated. The analytical solution reveals that the degree distribution of the weighted network is correlated with the increment and initial value of edge weights, which is verified by numerical simulations. Moreover, the evolving pattern of a clustering coefficient along with network parameters such as the size of a network, an updating coefficient, an initial weight and the competitiveness are obtained by further simulations.

Citation:

GuoJin-Li, Fan Chao, Ji Ya-Li.Universality of competitive networks in complex networks.  J Syst Sci Complex (2015) 28: 546–558

paper download:

2015-Universality of Competitive Networks in Complex Networks.pdf

自评：

复杂网络已经有了很多的模型，比如吸引度模型、适应度模型、加权模型等等，那么有没有一种模型能够表述其它网络模型呢？我们定义了竞争网络模型，该模型将BA模型的每次连m条边推广到每次连随机条边，我们论证了该模型在复杂网络各种模型中的普适性，并进行了精确的数值解析和模拟。