A Complex Network Growth Model Based on Advantage of “Recommended”

MING-ZE QI, HONG-ZHONG DENG, RUI WANG

Abstract


Complex network is a kind of network between stochastic network and regular network. In communication network, newcomers are more likely to get acquainted with new friends through their friends. In other words, these persons have advantage of recommended by others to become the newcomer’s friends. We put forward a model for growing network based on the distance (namely, the shortest path length). Each introduction of the nodes is no longer simultaneous and independent, but sequent. Moreover, according to the connection mechanism defined in this paper, the edges behind are closely related to the one in front, which is in accordance with the actual situation. Emulated analysis shows that the network formed by the model is consistent with the small world as well as scale-free nature of the complex network. Network also has higher clustering coefficient as well as larger average path length.

Keywords


Complex network, Growth model, RecommendedText


DOI
10.12783/dtcse/ceic2018/24551

Full Text:

PDF

Refbacks

  • There are currently no refbacks.