Graphical approach for influence maximization in social networks under generic threshold-based non-submodular model

As a widely observable social effect, influence diffusion refers to a process where innovations, trends, awareness, etc. spread across the network via the social impact among individuals. Motivated by such social effect, the concept of influence maximization is coined, where the goal is to select a bounded number of the most influential nodes (seed nodes) from a social network so that they can jointly trigger the maximal influence diffusion. A rich body of research in this area is performed under statistical diffusion models with provable submodularity, which essentially simplifies the problem as the optimal result can be approximated by the simple greedy search. When the diffusion models are non-submodular, however, the research community mostly focuses on how to bound/approximate them by tractable submodular functions. In other words, there is still a lack of efficient methods that can directly resolve non-submodular influence maximization problems. In this regard, we fill the gap by proposing seed selection strategies using network graphical properties in a generalized non-submodular threshold-based model, called influence barricade model. Under this model, we first establish theories to reveal graphical conditions that ensure the network generated by node removals has the same optimal seed set as that in the original network. We then exploit these theoretical conditions to develop efficient algorithms by strategically removing less-important nodes and selecting seeds only in the remaining network. To the best of our knowledge, this is the first graph-based approach that directly tackles non-submodular influence maximization. Evaluations on both synthetic and real-world Facebook/Twitter datasets confirm the superior efficiency of the proposed algorithms, which are orders of magnitude faster than benchmarks for large networks.

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

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

[3]  Scott Klasky,et al.  Towards Real-Time Detection and Tracking of Spatio-Temporal Features: Blob-Filaments in Fusion Plasma , 2015, IEEE Transactions on Big Data.

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

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

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

[7]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[8]  Laks V. S. Lakshmanan,et al.  From Competition to Complementarity: Comparative Influence Diffusion and Maximization , 2015, Proc. VLDB Endow..

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

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

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

[12]  Brian Kingsbury,et al.  Efficient one-vs-one kernel ridge regression for speech recognition , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[13]  Jie Chen,et al.  Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability , 2016, KDD.

[14]  My T. Thai,et al.  Maximizing the Spread of Positive Influence in Online Social Networks , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[15]  Deying Li,et al.  Minimum cost seed set for competitive social influence , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[16]  Mao Ye,et al.  On bundle configuration for viral marketing in social networks , 2012, CIKM.

[17]  Dylan Walker,et al.  Creating Social Contagion Through Viral Product Design: A Randomized Trial of Peer Influence in Networks , 2010, ICIS.

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

[19]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[20]  Liang Ma Influence Maximization Under Generic Threshold-based Non-submodular Model , 2020, ArXiv.

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

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