How to Maximize the Spread of Social Influence: A Survey

This survey presents the main results achieved for the influence maximization problem in social networks. This problem is well studied in the literature and, thanks to its recent applications, some of which currently deployed on the field, it is receiving more and more attention in the scientific community. The problem can be formulated as follows: given a graph, with each node having a certain probability of influencing its neighbors, select a subset of vertices so that the number of nodes in the network that are influenced is maximized. Starting from this model, we introduce the main theoretical developments and computational results that have been achieved, taking into account different diffusion models describing how the information spreads throughout the network, various ways in which the sources of information could be placed, and how to tackle the problem in the presence of uncertainties affecting the network. Finally, we present one of the main application that has been developed and deployed exploiting tools and techniques previously discussed.

[1]  Tanya Y. Berger-Wolf,et al.  Benefits of bias: towards better characterization of network sampling , 2011, KDD.

[2]  Michael R. Lyu,et al.  Mining social networks using heat diffusion processes for marketing candidates selection , 2008, CIKM '08.

[3]  N. Christakis,et al.  Social network targeting to maximise population behaviour change: a cluster randomised controlled trial , 2015, The Lancet.

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

[5]  E. Rice.  The Positive Role of Social Networks and Social Networking Technology in the Condom-Using Behaviors of Homeless Young People , 2010, Public health reports.

[6]  Edith Cohen,et al.  Leveraging discarded samples for tighter estimation of multiple-set aggregates , 2009, SIGMETRICS '09.

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

[8]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[9]  Charles X. Ling,et al.  Data Mining for Direct Marketing: Problems and Solutions , 1998, KDD.

[10]  Sébastien Bubeck,et al.  Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems , 2012, Found. Trends Mach. Learn..

[11]  Wei Chen,et al.  Combinatorial Multi-Armed Bandit: General Framework and Applications , 2013, ICML.

[12]  Jimeng Sun,et al.  A Survey of Models and Algorithms for Social Influence Analysis , 2011, Social Network Data Analytics.

[13]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[14]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

[15]  Nicole Immorlica,et al.  Maximizing Influence in an Unknown Social Network , 2018, AAAI.

[16]  Edith Cohen,et al.  Sketch-based Influence Maximization and Computation: Scaling up with Guarantees , 2014, CIKM.

[17]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Xiaowei Xu,et al.  A Novel Similarity-Based Modularity Function for Graph Partitioning , 2007, DaWaK.

[19]  Laks V. S. Lakshmanan,et al.  Influence Maximization with Bandits , 2015, ArXiv.

[20]  Haifeng Xu,et al.  Using Social Networks to Aid Homeless Shelters: Dynamic Influence Maximization under Uncertainty , 2016, AAMAS.

[21]  Yajun Wang,et al.  Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms , 2014, J. Mach. Learn. Res..

[22]  Laks V. S. Lakshmanan,et al.  CELF++: optimizing the greedy algorithm for influence maximization in social networks , 2011, WWW.

[23]  Lior Seeman,et al.  Adaptive Seeding in Social Networks , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[24]  Edith Cohen,et al.  Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..

[25]  Hiroyuki Ohsaki,et al.  Influence maximization problem for unknown social networks , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[26]  Gerard de Melo,et al.  DynaDiffuse: A Dynamic Diffusion Model for Continuous Time Constrained Influence Maximization , 2015, AAAI.

[27]  Yizhou Sun,et al.  SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks , 2010, CIKM.

[28]  S. Fienberg,et al.  Categorical Data Analysis of Single Sociometric Relations , 1981 .

[29]  Martin Zinkevich,et al.  Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.

[30]  Milind Tambe,et al.  Influence Maximization in the Field: The Arduous Journey from Emerging to Deployed Application , 2017, AAMAS.

[31]  Kyomin Jung,et al.  IRIE: Scalable and Robust Influence Maximization in Social Networks , 2011, 2012 IEEE 12th International Conference on Data Mining.

[32]  N. Milburn,et al.  Mobilizing homeless youth for HIV prevention: a social network analysis of the acceptability of a face-to-face and online social networking intervention. , 2012, Health education research.

[33]  Sujay Sanghavi,et al.  Learning the graph of epidemic cascades , 2012, SIGMETRICS '12.

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

[35]  Bernhard Schölkopf,et al.  Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.

[36]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[37]  Masahiro Kimura,et al.  Tractable Models for Information Diffusion in Social Networks , 2006, PKDD.

[38]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[39]  R. Campbell,et al.  Identifying influential young people to undertake effective peer-led health promotion: the example of A Stop Smoking In Schools Trial (ASSIST). , 2009, Health education research.

[40]  Nicole Immorlica,et al.  Uncharted but not Uninfluenced: Influence Maximization with an Uncertain Network , 2017, AAMAS.

[41]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[42]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

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

[44]  Masahiro Kimura,et al.  Prediction of Information Diffusion Probabilities for Independent Cascade Model , 2008, KES.

[45]  David Kempe,et al.  Robust Influence Maximization , 2016, KDD.

[46]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[47]  Edith Cohen,et al.  All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis , 2013, IEEE Transactions on Knowledge and Data Engineering.

[48]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[49]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery in Databases , 1996, AI Mag..

[50]  Suh-Yin Lee,et al.  CIM: Community-Based Influence Maximization in Social Networks , 2014, TIST.

[51]  Yifei Yuan,et al.  Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate , 2011, SDM.

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

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

[54]  Joel Veness,et al.  Monte-Carlo Planning in Large POMDPs , 2010, NIPS.

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

[56]  S. Feld.  Why Your Friends Have More Friends Than You Do , 1991, American Journal of Sociology.

[57]  Michael Kearns,et al.  Local Algorithms for Finding Interesting Individuals in Large Networks , 2010, ICS.

[58]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[59]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[60]  Balaji Rajagopalan,et al.  Knowledge-sharing and influence in online social networks via viral marketing , 2003, CACM.