Diffusion centrality: A paradigm to maximize spread in social networks

We propose Diffusion Centrality (DC) in which semantic aspects of a social network are used to characterize vertices that are influential in diffusing a property p. In contrast to classical centrality measures, diffusion centrality of vertices varies with the property p, and depends on the diffusion model describing how p spreads. We show that DC applies to most known diffusion models including tipping, cascade, and homophilic models. We present a hypergraph-based algorithm (HyperDC) with many optimizations to exactly compute DC. However, HyperDC does not scale well to huge social networks (millions of vertices, tens of millions of edges). For scaling, we develop methods to coarsen a network and propose a heuristic algorithm called "Coarsened Back and Forth" (CBAF) to compute the top-k vertices (having the highest diffusion centrality). We report on experiments comparing DC with classical centrality measures in terms of runtime and the "spread" achieved by the k most central vertices (using 7 real-world social networks and 3 different diffusion models). Our experiments show that DC produces higher quality results and is comparable to several centrality measures in terms of runtime.

[1]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[2]  Laks V. S. Lakshmanan,et al.  SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

[3]  George Karypis,et al.  METIS and ParMETIS , 2011, Encyclopedia of Parallel Computing.

[4]  Mohammad Bakher Naseri,et al.  Role of demographics, social connectedness and prior internet experience in adoption of online shopping: Applications for direct marketing , 2011 .

[5]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[6]  Masahiro Kimura,et al.  Efficient Estimation of Influence Functions for SIS Model on Social Networks , 2009, IJCAI.

[7]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

[8]  Y. Shavitt,et al.  An analysis of the Steam community network evolution , 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel.

[9]  Ning Chen,et al.  On the approximability of influence in social networks , 2008, SODA '08.

[10]  T. Schelling.  Micromotives and Macrobehavior , 1978 .

[11]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[12]  Judea Pearl,et al.  Bayesian Networks , 1998, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[13]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[14]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[15]  James A. Hendler,et al.  A Method to Rank Nodes in an RDF Graph , 2008, International Semantic Web Conference.

[16]  Krishna P. Gummadi,et al.  A measurement-driven analysis of information propagation in the flickr social network , 2009, WWW '09.

[17]  Anil Nerode,et al.  Hybrid Knowledge Bases , 1996, IEEE Trans. Knowl. Data Eng..

[18]  Sarit Kraus,et al.  Diffusion Centrality in Social Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[19]  Yao Zhang,et al.  Fast influence-based coarsening for large networks , 2014, KDD.

[20]  Aristides Gionis,et al.  Sparsification of influence networks , 2011, KDD.

[21]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[22]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[23]  Suh-Yin Lee,et al.  Efficient algorithms for influence maximization in social networks , 2012, Knowledge and Information Systems.

[24]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[25]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[26]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[27]  G. Sabidussi.  The centrality of a graph. , 1966, Psychometrika.

[28]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[29]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[30]  R. May,et al.  Population biology of infectious diseases: Part I , 1979, Nature.

[31]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[32]  Debmalya Panigrahi,et al.  A general framework for graph sparsification , 2010, STOC '11.

[33]  Louiqa Raschid,et al.  Graph Summarization in Annotated Data Using Probabilistic Soft Logic , 2012, URSW.

[34]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[35]  Nicola Barbieri,et al.  Online Topic-aware Influence Maximization Queries , 2014, EDBT.

[36]  Luis E. Ortiz,et al.  On influence, stable behavior, and the most influential individuals in networks: A game-theoretic approach , 2013, Artif. Intell..

[37]  Gao Cong,et al.  Simulated Annealing Based Influence Maximization in Social Networks , 2011, AAAI.

[38]  Cristian Molinaro,et al.  Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems , 2013, TOCL.

[39]  Xiaohui Lu,et al.  Local, community and global centrality methods for analyzing networks , 2014, Social Network Analysis and Mining.

[40]  Chanhyun Kang,et al.  Does Financial Connectedness Predict Crises? , 2013 .

[41]  Rami Puzis,et al.  Routing betweenness centrality , 2010, JACM.

[42]  Hong-Gwa Yeh,et al.  Some results on the target set selection problem , 2011, Journal of Combinatorial Optimization.

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

[44]  H. Hethcote.  Qualitative analyses of communicable disease models , 1976 .

[45]  Tomasz P. Michalak,et al.  A Centrality Measure for Networks With Community Structure Based on a Generalization of the Owen Value , 2014, ECAI.

[46]  Paulo Shakarian,et al.  A Scalable Framework for Modeling Competitive Diffusion in Social Networks , 2010, 2010 IEEE Second International Conference on Social Computing.

[47]  R. May,et al.  Population biology of infectious diseases: Part II , 1979, Nature.

[48]  Nicola Barbieri,et al.  Topic-aware social influence propagation models , 2012, Knowledge and Information Systems.

[49]  Luc De Raedt,et al.  Inference and learning in probabilistic logic programs using weighted Boolean formulas , 2013, Theory and Practice of Logic Programming.

[50]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[51]  Damon Centola,et al.  The Spread of Behavior in an Online Social Network Experiment , 2010, Science.

[52]  Fang Zhou,et al.  Compression of weighted graphs , 2011, KDD.

[53]  Masahiro Kimura,et al.  Extracting Influential Nodes for Information Diffusion on a Social Network , 2007, AAAI.

[54]  Ruocheng Guo,et al.  Diffusion in Social Networks , 2015, SpringerBriefs in Computer Science.

[55]  D. Watts,et al.  Viral marketing for the real world , 2007 .

[56]  D Shapley.  Science foundation. , 1974, Science.

[57]  Fang Zhou,et al.  Network Compression by Node and Edge Mergers , 2012, Bisociative Knowledge Discovery.

[58]  Arun Sundararajan,et al.  Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks , 2009, Proceedings of the National Academy of Sciences.

[59]  V. S. Subrahmanian,et al.  Using Twitter Sentiment to Forecast the 2013 Pakistani Election and the 2014 Indian Election , 2015, IEEE Intelligent Systems.