IDENTIFYING INFLUENTIAL SPREADERS IN ARTIFICIAL COMPLEX NETWORKS  

作　　者：WANG Pei TIAN Chengeng LU Jun-an 

机构地区：[1]School of Mathematics and Information Sciences,Henan University [2]School of Mathematics and Statistics,Wuhan University

出　　处：《Journal of Systems Science & Complexity》2014年第4期650-665,共16页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.11172215,61304151,61174028;China-Australia Health and HIV/AIDS Facility(FA36 EID101);the Science Foundation of Henan University under Grant No.2012YBZR007

摘　　要：A long-term common belief in complex networks is that,the most connected nodes are the most efficient spreaders.However,recent investigations on real-world complex networks show that the most influential spreaders are those with the highest fc-shell values.It is well-known that,many real-world complex networks have scale free(SF),small world(SW) properties,therefore,identification of influential spreaders in general artificial SF,SW as well as random networks will be more appealing.This research finds that,for artificial ER and SW networks,degree is more reliable than fc-shell in predicting the outcome of spreading.However,for artificial SF networks,fc-shell is remarkably reliable than degree and betweeness,which indicate that the four recently investigated real-world networks[Kitsak M,Gallos L K,Havlin S,Liljeros F,Muchnik L,Stanley H E,Makse H A,Identification of influential spreaders in complex networks,Nat.Phys.,2010,6:888-893.]are more similar to scale free ones.Moreover,the investigations also indicate us an optimal dissemination strategy in networks with scale free property.That is,starting from moderate-degree-nodes will be ok and even more economical,since one can derive roughly similar outcome with starting from hubs.

关 键 词：Complex network influential spreader K-SHELL scale free small world. 

分 类 号：O157.5[理学—数学]