Seeding with Costly Network Information

05/10/2019
by   Dean Eckles, et al.
0

The spread of behavior over social networks depends on the contact structure among individuals, and seeding the most influential agents can substantially enhance the extent of the spread. While the choice of the best seed set, known as influence maximization, is a computationally hard problem, many computationally efficient algorithms have been proposed to approximate the optimal seed sets with provable guarantees. Most of the previous work on influence maximization assumes the knowledge of the entire network graph. However, in practice, obtaining full knowledge of the network structure is very costly. In this work, we consider the choice of k initial seeds to maximize the expected number of adopters under the independent cascade model. We propose a "probe-and-seed" algorithm that provides almost tight approximation guarantees using Õ(p n^2 + √(p) n^1.5) edge queries in Õ(p n^2 + √(p) n^1.5) time, where n is the network size and p is the probability of spreading through an edge. To the best of our knowledge, this is the first result to provide approximation guarantees for influence maximization, using a sub-quadratic number of queries for polynomially small p. We complement this result by showing that it is impossible to approximate the problem using o(n^2) edge queries for constant p. In the end, we consider a more advanced query model, where one seeds a node and observes the resultant adopters after running the spreading process. We provide an algorithm that uses only Õ(k^2) such queries and provides almost tight approximation guarantees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2020

VAIM: Visual Analytics for Influence Maximization

In social networks, individuals' decisions are strongly influenced by re...
research
06/07/2021

Network Inference and Influence Maximization from Samples

Influence maximization is the task of selecting a small number of seed n...
research
10/24/2020

Correlation Robust Influence Maximization

We propose a distributionally robust model for the influence maximizatio...
research
12/18/2020

Influence Maximization Under Generic Threshold-based Non-submodular Model

As a widely observable social effect, influence diffusion refers to a pr...
research
03/17/2020

Maximizing Influence-based Group Shapley Centrality

One key problem in network analysis is the so-called influence maximizat...
research
09/13/2021

Online Influence Maximization with Node-level Feedback Using Standard Offline Oracles

We study the online influence maximization (OIM) problem in social netwo...
research
08/07/2020

Boosting Parallel Influence-Maximization Kernels for Undirected Networks with Fusing and Vectorization

Influence maximization (IM) is the problem of finding a seed vertex set ...

Please sign up or login with your details

Forgot password? Click here to reset