Network Model with Scale‐Free, High Clustering Coefficients, and Small‐World Properties

Networks are prevalent in real life, and the study of network evolution models is very important for understanding the nature and laws of real networks. The distribution of the initial degree of nodes in existing classical models is constant or uniform. The model we proposed shows binomial distribution, and it is consistent with real network data. The theoretical analysis shows that the proposed model is scale‐free at different probability values and its clustering coefficients are adjustable, and the Barabasi‐Albert model is a special case of p = 0 in our model. In addition, the analytical results of the clustering coefficients can be estimated using mean‐field theory. The mean clustering coefficients calculated from the simulated data and the analytical results tend to be stable. The model also exhibits small‐world characteristics and has good reproducibility for short distances of real networks. Our model combines three network characteristics, scale‐free, high clustering coefficients, and small‐world characteristics, which is a significant improvement over traditional models with only a single or two characteristics. The theoretical analysis procedure can be used as a theoretical reference for various network models to study the estimation of clustering coefficients. The existence of stable equilibrium points of the model explains the controversy of whether scale‐free is universal or not, and this explanation provides a new way of thinking to understand the problem.