Threshold models for competitive influence in social networks
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Competitive contagion in networks
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Application of the ant colony optimization algorithm to competitive viral marketing
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Learning influence in complex social networks
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Strategyproof mechanisms for competitive influence in networks
Proceedings of the 22nd international conference on World Wide Web
How to influence people with partial incentives
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
Social networks are often represented as directed graphs, where the nodes are individuals and the edges indicate a form of social relationship. A simple way to model the diffusion of ideas, innovative behavior, or “word-of-mouth” effects on such a graph is to consider an increasing process of “infected” (or active) nodes: each node becomes infected once an activation function of the set of its infected neighbors crosses a certain threshold value. Such a model was introduced by Kempe, Kleinberg, and Tardos (KKT) in [Maximizing the spread of influence through a social network, in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137-146] and [Influential nodes in a diffusion model for social networks, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005], where the authors also impose several natural assumptions: the threshold values are random and the activation functions are monotone and submodular. The monotonicity condition indicates that a node is more likely to become active if more of its neighbors are active, while the submodularity condition indicates that the marginal effect of each neighbor is decreasing when the set of active neighbors increases. For an initial set of active nodes $S$, let $\sigma(S)$ denote the expected number of active nodes at termination. Here, we prove a conjecture of KKT: we show that the function $\sigma(S)$ is submodular under the assumptions above. We prove the same result for the expected value of any monotone, submodular function of the set of active nodes at termination. Roughly, our results demonstrate that “local” submodularity is preserved “globally” under this diffusion process. This is of natural computational interest, as many optimization problems have good approximation algorithms for submodular functions.