Universality of Competitive Networks in Complex Networks

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.