Neighborhood Matters: Influence Maximization in Social Networks with Limited Access

10/03/2020
by   Chen Feng, et al.
0

Influence maximization (IM) aims at maximizing the spread of influence by offering discounts to influential users (called seeding). In many applications, due to user's privacy concern, overwhelming network scale etc., it is hard to target any user in the network as one wishes. Instead, only a small subset of users is initially accessible. Such access limitation would significantly impair the influence spread, since IM often relies on seeding high degree users, which are particularly rare in such a small subset due to the power-law structure of social networks. In this paper, we attempt to solve the limited IM in real-world scenarios by the adaptive approach with seeding and diffusion uncertainty considered. Specifically, we consider fine-grained discounts and assume users accept the discount probabilistically. The diffusion process is depicted by the independent cascade model. To overcome the access limitation, we prove the set-wise friendship paradox (FP) phenomenon that neighbors have higher degree in expectation, and propose a two-stage seeding model with the FP embedded, where neighbors are seeded. On this basis, for comparison we formulate the non-adaptive case and adaptive case, both proven to be NP-hard. In the non-adaptive case, discounts are allocated to users all at once. We show the monotonicity of influence spread w.r.t. discount allocation and design a two-stage coordinate descent framework to decide the discount allocation. In the adaptive case, users are sequentially seeded based on observations of existing seeding and diffusion results. We prove the adaptive submodularity and submodularity of the influence spread function in two stages. Then, a series of adaptive greedy algorithms are proposed with constant approximation ratio.

READ FULL TEXT

page 4

page 6

page 7

page 9

page 13

page 17

page 18

page 21

research
10/01/2017

Activating the "Breakfast Club": Modeling Influence Spread in Natural-World Social Networks

While reigning models of diffusion have privileged the structure of a gi...
research
02/14/2018

Influential User Subscription on Time-Decaying Social Streams

Influence maximization which asks for k-size seed set from a social netw...
research
10/09/2019

A k-hop Collaborate Game Model: Adaptive Strategy to Maximize Total Revenue

In Online Social Networks (OSNs), interpersonal communication and inform...
research
04/14/2021

ABEM: An Adaptive Agent-based Evolutionary Approach for Mining Influencers in Online Social Networks

A key step in influence maximization in online social networks is the id...
research
07/13/2021

Identifying Influential Users in Unknown Social Networks for Adaptive Incentive Allocation Under Budget Restriction

In recent years, recommendation systems have been widely applied in many...
research
06/19/2020

Rumor source detection with multiple observations under adaptive diffusions

Recent work, motivated by anonymous messaging platforms, has introduced ...
research
11/08/2019

Beyond Adaptive Submodularity: Adaptive Influence Maximization with Intermediary Constraints

We consider a brand with a given budget that wants to promote a product ...

Please sign up or login with your details

Forgot password? Click here to reset