Mutual attraction model for both assortative and disassortative weighted networks.
For most complex networks, the connection between a pair of nodes is the result of their mutual affinity and attachment. In this letter, we will propose a mutual attraction model to characterize weighted evolving networks. By introducing the initial attractiveness A and the general mechanism of mutual attraction (controlled by parameter m), our model can naturally reproduce scale-free distributions of degree, weight, and strength, as found in many real systems. Also, simulation results are consistent with theoretical predictions. Interestingly, we obtain nontrivial clustering coefficient C and tunable degree assortativity r, depending on the values of m and A. Our model appears as a more general one that unifies the characterization of both assortative and disassortative weighted networks.
Wang
Wen-Xu
WX
Nonlinear Science Center and Department of Modern Physics, University of Science and Technology of China, Hefei 230026, China.
Hu
Bo
B
Wang
Bing-Hong
BH
Yan
Gang
G