Online Influence Maximization in Non-Stationary Social Networks

TL;DR

This paper introduces a multi-armed bandit-based algorithm for influence maximization in dynamic, non-stationary social networks, effectively adapting to changing influence probabilities and network structures over time.

Contribution

It proposes a novel online algorithm, RSB, that optimizes influence spread in evolving social networks using adaptive exploration and exploitation strategies.

Findings

RSB outperforms stationary methods in non-stationary settings

The algorithm achieves bounded regret in influence maximization tasks

Validated on synthetic and real-world datasets

Abstract

Social networks have been popular platforms for information propagation. An important use case is viral marketing: given a promotion budget, an advertiser can choose some influential users as the seed set and provide them free or discounted sample products; in this way, the advertiser hopes to increase the popularity of the product in the users' friend circles by the world-of-mouth effect, and thus maximizes the number of users that information of the production can reach. There has been a body of literature studying the influence maximization problem. Nevertheless, the existing studies mostly investigate the problem on a one-off basis, assuming fixed known influence probabilities among users, or the knowledge of the exact social network topology. In practice, the social network topology and the influence probabilities are typically unknown to the advertiser, which can be varying over time, i.e., in cases of newly established, strengthened or weakened social ties. In this paper, we focus on a dynamic non-stationary social network and design a randomized algorithm, RSB, based on multi-armed bandit optimization, to maximize influence propagation over time. The algorithm produces a sequence of online decisions and calibrates its explore-exploit strategy utilizing outcomes of previous decisions. It is rigorously proven to achieve an upper-bounded regret in reward and applicable to large-scale social networks. Practical effectiveness of the algorithm is evaluated using both synthetic and real-world datasets, which demonstrates that our algorithm outperforms previous stationary methods under non-stationary conditions.