作者: Shuangyan Wang , Wuyi Cheng , Gang Mei
DOI: 10.1109/ACCESS.2019.2909051
关键词: Complex system 、 Complex network 、 Scale-free network 、 Distributed computing 、 Heterogeneous network 、 Small-world network 、 Field (computer science) 、 Monte Carlo method 、 Assortativity
摘要: Many complex systems are abstractly regarded as networks in the study of complicated problems. The research field information spreading has attracted extensive interest. strategies have been proposed for improving efficiency networks. However, differ terms performance various In this paper, a hybrid and effective method small-world assortative scale-free is proposed. can be applied to solve essential problem low due small-degree vertices. combines two strategies: 1) set top vertices specified initial spreaders 2) preferentially spread large-degree neighbors. Sixty-eight groups Monte Carlo experiments conducted three real seventeen synthetic According experimental results theoretical analysis, efficient Moreover, networks, improvement that realized via increases with assortativity coefficient.