From unweighted to weighted networks with local information

2007 
In this paper, we analyze an evolving model with local information which can generate a class of networks by choosing different values of the parameter p. The model introduced exhibits the transition from unweighted networks to weighted networks because the distribution of the edge weight can be widely tuned. With the increase in the local information, the degree correlation of the network transforms from assortative to disassortative. We also study the distribution of the degree, strength and edge weight, which all show crossover between exponential and scale-free. Finally, an application of the proposed model to the study of the synchronization is considered. It is concluded that the synchronizability is enhanced when the heterogeneity of the edge weight is reduced.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    26
    References
    18
    Citations
    NaN
    KQI
    []