Seeking powerful information initial spreaders in online social networks: a dense group perspective

The rapid growth of online social networks (OSNs) has ultimately facilitated information spreading and changed the economics of mobile networks. It is important to understand how to spread information as widely as possible. In this paper, we aim to seek powerful information initial spreaders with an efficient manner. We use the mean-field theory to characterize the process of information spreading based on the Susceptible Infected (SI) model and validate that the prevalence of information depends on the network density. Inspired by this result, we seek the initial spreaders from closely integrated groups of nodes, i.e., dense groups (DGs). In OSNs, DGs distribute dispersedly over the network, so our approach can be fulfilled in a distributed way by seeking the spreaders in each DG. We first design a DG Generating Algorithm to detect DGs, where nodes within the DG have more internal connections than external ones. Second, based on the detected DGs, we design a criterion to seek powerful initial spreaders from each DG. We conduct experiments as well as statistical analysis on real OSNs. The results show that our approach provides a satisfactory performance as well as computational efficiency.

[1]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[2]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Aditya Gopalan,et al.  Random mobility and the spread of infection , 2011, 2011 Proceedings IEEE INFOCOM.

[4]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[5]  Ning Zhang,et al.  Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process , 2012, AAAI.

[6]  Hakim Hacid,et al.  A predictive model for the temporal dynamics of information diffusion in online social networks , 2012, WWW.

[7]  Fan Yang,et al.  Automatic detection of rumor on Sina Weibo , 2012, MDS '12.

[8]  Yaron Singer,et al.  Scalable Methods for Adaptively Seeding a Social Network , 2015, WWW.

[9]  Hao Tu,et al.  Sina Microblog: An Information-Driven Online Social Network , 2011, 2011 International Conference on Cyberworlds.

[10]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Lada A. Adamic,et al.  The role of social networks in information diffusion , 2012, WWW.

[12]  R. Alba.  A graph‐theoretic definition of a sociometric clique† , 1973 .

[13]  Lei Ying,et al.  Information source detection in the SIR model: A sample path based approach , 2012, 2013 Information Theory and Applications Workshop (ITA).

[14]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

[15]  Hosung Park,et al.  What is Twitter, a social network or a news media? , 2010, WWW '10.

[16]  An Zeng,et al.  Iterative resource allocation for ranking spreaders in complex networks , 2014 .

[17]  L. Bécu,et al.  Evidence for three-dimensional unstable flows in shear-banding wormlike micelles. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[19]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[20]  Martin J. Osborne,et al.  An Introduction to Game Theory , 2003 .

[21]  Aditya Gopalan,et al.  Epidemic Spreading With External Agents , 2014, IEEE Transactions on Information Theory.

[22]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[23]  Arnaud Legout,et al.  How to network in online social networks , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[24]  Jian-Guo Liu,et al.  Iterative resource allocation based on propagation feature of node for identifying the influential nodes , 2015, ArXiv.

[25]  Nam P. Nguyen,et al.  Overlapping communities in dynamic networks: their detection and mobile applications , 2011, MobiCom.

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

[27]  Esteban Moro Egido,et al.  The dynamical strength of social ties in information spreading , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  J. Boudec,et al.  A Generic Mean Field Convergence Result for Systems of Interacting Objects , 2007 .

[29]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[30]  Jean-Yves Le Boudec,et al.  A class of mean field interaction models for computer and communication systems , 2008, Perform. Evaluation.

[31]  Jinwoo Shin,et al.  On maximizing diffusion speed in social networks: impact of random seeding and clustering , 2014, SIGMETRICS '14.

[32]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[33]  Jie Wu,et al.  Geocommunity-Based Broadcasting for Data Dissemination in Mobile Social Networks , 2012 .

[34]  R. Pastor-Satorras,et al.  Epidemic spreading in correlated complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  H. Proudhon,et al.  Methodology for studying strain inhomogeneities in polycrystalline thin films during in situ thermal loading using coherent x-ray diffraction , 2010 .

[36]  Xiaobo Zhou,et al.  Please spread: recommending tweets for retweeting with implicit feedback , 2012, DUBMMSM '12.

[37]  My T. Thai,et al.  Cost-Effective Viral Marketing for Time-Critical Campaigns in Large-Scale Social Networks , 2014, IEEE/ACM Transactions on Networking.

[38]  Chuang Ma,et al.  Identifying influential spreaders in complex networks based on gravity formula , 2015, ArXiv.