Adaptive Influence Maximization in Dynamic Social Networks
Guangmo Tong, Weili Wu, Shaojie Tang, Ding-Zhu Du

TL;DR
This paper introduces an adaptive influence maximization strategy for dynamic social networks, addressing the limitations of static models by effectively capturing network changes and improving influence spread.
Contribution
It models the Dynamic Independent Cascade process and proposes a greedy adaptive seeding algorithm with proven performance guarantees.
Findings
Adaptive strategies outperform static methods in dynamic networks.
The greedy algorithm achieves a provable approximation ratio.
Experimental results validate the effectiveness on real and synthetic networks.
Abstract
For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization problem. Despite a large number of works have studied this problem, the existing seeding strategies are limited to the static social networks. In fact, due to the high speed data transmission and the large population of participants, the diffusion processes in real-world social networks have many aspects of uncertainness. Unfortunately, as shown in the experiments, in such cases the state-of-art seeding strategies are pessimistic as they fails to trace the dynamic changes in a social network. In this paper, we study the strategies selecting seed users in an adaptive manner. We first formally model the Dynamic Independent Cascade model and introduce the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
