کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1891239 | 1533639 | 2016 | 7 صفحه PDF | دانلود رایگان |
The problem of identifying influential spreaders in complex networks has attracted much attention because of its great theoretical significance and wide application. In this paper, we propose a successful ranking method for identifying the influential spreaders. The proposed method measures the spreading ability of nodes based on their degree and their ability of spreading out. We also use a tuning weight parameter, which is always associated with the property of the networks such as the assortativity, to regulate the weight between the degree and the ability of spreading out. To test the effectiveness of the proposed method, we conduct the experiments on several synthetic networks and real-world networks. The results show that the proposed method outperforms the existing well-known ranking methods.
Journal: Chaos, Solitons & Fractals - Volume 86, May 2016, Pages 1–7