Improving short-term information spreading efficiency in scale-free networks by specifying top large-degree vertices as the initial spreaders

The positive function of initially influential vertices could be exploited to improve spreading efficiency for short-term spreading in scale-free networks. However, the selection of initial spreaders depends on the specific scenes. The selection of initial spreaders needs to offer low complexity and low power consumption for short-term spreading. In this paper, we propose a selection strategy for efficiently spreading information by specifying a set of top large-degree vertices as the initially informed vertices. The essential idea behind the proposed selection strategy is to exploit the significant diffusion of the top large-degree vertices at the beginning of spreading. To evaluate the positive impact of initially influential vertices, we first build an information spreading model in the Barabási–Albert (BA) scale-free network; next, we design 54 comparative Monte Carlo experiments based on a benchmark strategy and the proposed selection strategy in different BA scale-free network structures. Experimental results indicate that (i) the proposed selection strategy can significantly improve spreading efficiency in the short-term spreading and (ii) both network size and number of hubs have a strong impact on spreading efficiency, while the number of initially informed vertices has a weak impact. The proposed selection strategy can be employed in short-term spreading, such as sending warnings or crisis information spreading or information spreading in emergency training or realistic emergency scenes.

[1]  Ying-Cheng Lai,et al.  Selectivity-based spreading dynamics on complex networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Jianguo Liu,et al.  Identifying multiple influential spreaders in term of the distance-based coloring , 2016 .

[3]  Salvatore Cuomo,et al.  A Cultural Heritage Case Study of Visitor Experiences Shared on a Social Network , 2015, 2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC).

[4]  Leandros Tassiulas,et al.  Detecting Influential Spreaders in Complex, Dynamic Networks , 2013, Computer.

[5]  Elliot Anshelevich,et al.  Seeding influential nodes in non-submodular models of information diffusion , 2013, Autonomous Agents and Multi-Agent Systems.

[6]  A-L Barabási,et al.  Structure and tie strengths in mobile communication networks , 2006, Proceedings of the National Academy of Sciences.

[7]  Fan Yang,et al.  Identifying the most influential spreaders in complex networks by an Extended Local K-Shell Sum , 2017 .

[8]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  D. Watts,et al.  Influentials, Networks, and Public Opinion Formation , 2007 .

[10]  Duncan J. Watts,et al.  Everyone's an influencer: quantifying influence on twitter , 2011, WSDM '11.

[11]  Steffen Staab,et al.  Social Networks Applied , 2005, IEEE Intell. Syst..

[12]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[13]  Chung-Yuan Huang,et al.  Using global diversity and local topology features to identify influential network spreaders , 2015 .

[14]  S. Mahadevan,et al.  Identifying influential nodes in weighted networks based on evidence theory , 2013 .

[15]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[16]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[17]  周鹏,et al.  Identifying influential nodes based on graph signal processing in complex networks , 2015 .

[18]  Ning Zhang,et al.  Effects of rewiring strategies on information spreading in complex dynamic networks , 2018, Commun. Nonlinear Sci. Numer. Simul..

[19]  Naomichi Hatano,et al.  Viral spreading of daily information in online social networks , 2012 .

[20]  Yamir Moreno,et al.  Absence of influential spreaders in rumor dynamics , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Ming Tang,et al.  Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition , 2014, Scientific Reports.

[22]  Qiang Guo,et al.  Locating influential nodes via dynamics-sensitive centrality , 2015, Scientific Reports.

[23]  Jukka-Pekka Onnela,et al.  Spreading paths in partially observed social networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Hyoungshick Kim,et al.  Influential Neighbours Selection for Information Diffusion in Online Social Networks , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[25]  Wang Hui,et al.  Dynamics of rumor spreading in mobile social networks , 2013 .

[26]  Hernán A. Makse,et al.  Spreading dynamics in complex networks , 2013, ArXiv.

[27]  Tao Zhou,et al.  Optimal contact process on complex networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Mark E. J. Newman A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[29]  Pedro M. Domingos Mining Social Networks for Viral Marketing , 2022 .

[30]  David M. Pennock,et al.  Predicting consumer behavior with Web search , 2010, Proceedings of the National Academy of Sciences.

[31]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[32]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[33]  Salvatore Cuomo,et al.  A Biologically Inspired Model for Analyzing Behaviours in Social Network Community and Cultural Heritage Scenario , 2014, 2014 Tenth International Conference on Signal-Image Technology and Internet-Based Systems.

[34]  Albert-László Barabási,et al.  Scale-free networks , 2008, Scholarpedia.

[35]  Lei Gao,et al.  Effective information spreading based on local information in correlated networks , 2016, Scientific Reports.