Comprehensive Weighted Clique Degree Ranking Algorithms and Evolutionary Model of Complex Network

• Main Authors: Xu Jie, Liu Zhen, Xu Jun
• Format: Article
• Language: English
• Published: EDP Sciences 2016-01-01
• Series: MATEC Web of Conferences
• Online Access: http://dx.doi.org/10.1051/matecconf/20167101004

This paper analyses the degree ranking (DR) algorithm, and proposes a new comprehensive weighted clique degree ranking (CWCDR) algorithms for ranking importance of nodes in complex network. Simulation results show that CWCDR algorithms not only can overcome the limitation of degree ranking algorithm, but also can find important nodes in complex networks more precisely and effectively. To the shortage of small-world model and BA model, this paper proposes an evolutionary model of complex network based on CWCDR algorithms, named CWCDR model. Simulation results show that the CWCDR model accords with power-law distribution. And compare with the BA model, this model has better average shortest path length, and clustering coefficient. Therefore, the CWCDR model is more consistent with the real network.