Popular Topics Spread Faster: New Dimension for Influence Propagation in Online Social Networks

Although influence propagation of Online Social Networks (OSNs) is widely studied in literature, none of the existing works can cope with the situation that the propagation rate dynamically increases for popular topics. Instead, they all assumed known rates (either constants or drawn from known distributions) for influence propagation models. However, such models cannot correctly describe influence diffusion in reality. In this paper, we propose a novel model, Dynamic Influence Propagation (DIP), that allows propagation rate to change during the diffusion, based on which we define a new problem: Threshold Activation Problem under DIP (TAP-DIP), which adds another layer of complexity over the already \#P-Hard TAP problem. Despite the hardness of TAP-DIP, we are able to design a Lipschitz Optimization scheme (LOS) that can solve TAP-DIP with $O(\log|V|)$ ratio where $V$ is the set of nodes in the OSN. Using various real OSN datasets, we experimentally demonstrate that LOS not only generates high-quality yet much smaller seed sets when being aware of the rate increase, but also scalable.

[1]  Le Song,et al.  Scalable Influence Estimation in Continuous-Time Diffusion Networks , 2013, NIPS.

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

[3]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[4]  Xiang Li,et al.  Why approximate when you can get the exact? Optimal targeted viral marketing at scale , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

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

[6]  Cheng Long,et al.  Minimizing Seed Set for Viral Marketing , 2011, 2011 IEEE 11th International Conference on Data Mining.

[7]  My T. Thai,et al.  Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? , 2012, HT '12.

[8]  Laks V. S. Lakshmanan,et al.  On minimizing budget and time in influence propagation over social networks , 2012, Social Network Analysis and Mining.

[9]  Philip S. Yu,et al.  Influence Maximization Across Partially Aligned Heterogenous Social Networks , 2015, PAKDD.

[10]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[11]  Peng Zhang,et al.  Minimizing seed set selection with probabilistic coverage guarantee in a social network , 2014, KDD.

[12]  M. Degroot,et al.  Probability and Statistics , 1977 .

[13]  Yaroslav D. Sergeyev,et al.  Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives , 2013, SIAM J. Optim..

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

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

[16]  Thang N. Dinh,et al.  Cost-aware Targeted Viral Marketing in billion-scale networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[17]  Nam P. Nguyen,et al.  Overlapping Community Structures and Their Detection on Social Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[18]  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.

[19]  My T. Thai,et al.  Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.

[20]  My T. Thai,et al.  Least Cost Influence in Multiplex Social Networks: Model Representation and Analysis , 2013, 2013 IEEE 13th International Conference on Data Mining.

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

[22]  Xiang Li,et al.  Dynamic Propagation Rates: New Dimension to Viral Marketing in Online Social Networks , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[23]  My T. Thai,et al.  Scalable bicriteria algorithms for the threshold activation problem in online social networks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[24]  Bernhard Schölkopf,et al.  Influence Maximization in Continuous Time Diffusion Networks , 2012, ICML.

[25]  Nam P. Nguyen,et al.  A novel method for worm containment on dynamic social networks , 2010, 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE.

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

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

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

[29]  Preetam Ghosh,et al.  Social Influence Spectrum with Guarantees: Computing More in Less Time , 2015, CSoNet.

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

[31]  Tapio Elomaa,et al.  Covering Analysis of the Greedy Algorithm for Partial Cover , 2010, Algorithms and Applications.