Computing competing cascades on signed networks

Often in marketing, political campaigns and social media, two competing products or opinions propagate over a social network. Studying social influence in such competing cascade scenarios enables building effective strategies for maximizing the propagation of one process by targeting the most “influential” nodes in the network. The majority of prior work, however, focuses on unsigned networks where individuals adopt the opinion of their neighbors with certain probability. In real life, relationships between individuals can be positive (e.g., friend of relationship) or negative (e.g., connection between “foes”). According to social theory, people tend to have similar opinions to their friends but opposite of their foes. We study the problem of competing cascades on signed networks, which has been relatively unexplored. Particularly, we study the progressive propagation of two competing cascades in a signed network under the Independent Cascade Model and Generalized Linear Threshold Model and provide an approximate analytical solution to compute the probability of infection of a node at any given time. We validate the quality of our approximation on several synthetic graphs. We leverage our analytical solution to the problem of competing cascades in signed networks to develop a heuristic for the influence maximization problem. We allow the seed-set to be initialized with populations of both cascades with the end goal of maximizing the spread of one cascade. We validate our approach on several large-scale real-world and synthetic networks. Our experiments demonstrate that our influence maximization heuristic significantly outperforms state-of-the-art methods, particularly when the network is dominated by distrust relationships.

[1]  Viktor K. Prasanna,et al.  Influence in social networks: A unified model? , 2014, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014).

[2]  K. Sycara,et al.  Polarity Related Influence Maximization in Signed Social Networks , 2014, PloS one.

[3]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

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

[5]  Christos Faloutsos,et al.  Kronecker Graphs: An Approach to Modeling Networks , 2008, J. Mach. Learn. Res..

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

[7]  Christos Faloutsos,et al.  The Web as a Jungle: Non-Linear Dynamical Systems for Co-evolving Online Activities , 2015, WWW.

[8]  Viktor K. Prasanna,et al.  Social influence computation and maximization in signed networks with competing cascades , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[9]  Viktor K. Prasanna,et al.  Computational models of technology adoption at the workplace , 2014, Social Network Analysis and Mining.

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

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

[12]  Wei Chen,et al.  Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships , 2011, WSDM.

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

[14]  Viktor K. Prasanna,et al.  The role of organization hierarchy in technology adoption at the workplace , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[15]  Divyakant Agrawal,et al.  Diffusion of Information in Social Networks: Is It All Local? , 2012, 2012 IEEE 12th International Conference on Data Mining.

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

[17]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

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

[19]  Jaideep Srivastava,et al.  A Generalized Linear Threshold Model for Multiple Cascades , 2010, 2010 IEEE International Conference on Data Mining.

[20]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

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

[22]  Jure Leskovec,et al.  Clash of the Contagions: Cooperation and Competition in Information Diffusion , 2012, 2012 IEEE 12th International Conference on Data Mining.

[23]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[24]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .