Limitations of Greed: Influence Maximization in Undirected Networks Re-visited

02/26/2020
by   Grant Schoenebeck, et al.
0

We consider the influence maximization problem (selecting k seeds in a network maximizing the expected total influence) on undirected graphs under the linear threshold model. On the one hand, we prove that the greedy algorithm always achieves a (1 - (1 - 1/k)^k + Ω(1/k^3))-approximation, showing that the greedy algorithm does slightly better on undirected graphs than the generic (1- (1 - 1/k)^k) bound which also applies to directed graphs. On the other hand, we show that substantial improvement on this bound is impossible by presenting an example where the greedy algorithm can obtain at most a (1- (1 - 1/k)^k + O(1/k^0.2)) approximation. This result stands in contrast to the previous work on the independent cascade model. Like the linear threshold model, the greedy algorithm obtains a (1-(1-1/k)^k)-approximation on directed graphs in the independent cascade model. However, Khanna and Lucier showed that, in undirected graphs, the greedy algorithm performs substantially better: a (1-(1-1/k)^k + c) approximation for constant c > 0. Our results show that, surprisingly, no such improvement occurs in the linear threshold model. Finally, we show that, under the linear threshold model, the approximation ratio (1 - (1 - 1/k)^k) is tight if 1) the graph is directed or 2) the vertices are weighted. In other words, under either of these two settings, the greedy algorithm cannot achieve a (1 - (1 - 1/k)^k + f(k))-approximation for any positive function f(k). The result in setting 2) is again in a sharp contrast to Khanna and Lucier's (1 - (1 - 1/k)^k + c)-approximation result for the independent cascade model, where the (1 - (1 - 1/k)^k + c) approximation guarantee can be extended to the setting where vertices are weighted. We also discuss extensions to more generalized settings including those with edge-weighted graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2019

Perturbed Greedy on Oblivious Matching Problems

We study the maximum matching problem in the oblivious setting, i.e. the...
research
07/16/2020

Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies

In the adaptive influence maximization problem, we are given a social ne...
research
06/27/2020

Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback

In the influence maximization (IM) problem, we are given a social networ...
research
10/29/2020

Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering

Centrality measures characterize important nodes in networks. Efficientl...
research
12/03/2019

On irreversible spread of influence in edge-weighted graphs

Various kinds of spread of influence occur in real world social and virt...
research
02/11/2019

Election Manipulation on Social Networks with Messages on Multiple Candidates

We study the problem of election control through social influence when t...
research
01/23/2018

The Importance of Communities for Learning to Influence

We consider the canonical problem of influence maximization in social ne...

Please sign up or login with your details

Forgot password? Click here to reset