Influence maximization on temporal networks : a review
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A2 Katsausartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Date
2024-05-21
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
25
Series
Applied Network Science, Volume 9, issue 1, pp. 1-25
Abstract
Influence maximization (IM) is an important topic in network science where a small seed set is chosen to maximize the spread of influence on a network. Recently, this problem has attracted attention on temporal networks where the network structure changes with time. IM on such dynamically varying networks is the topic of this review. We first categorize methods into two main paradigms: single and multiple seeding. In single seeding, nodes activate at the beginning of the diffusion process, and most methods either efficiently estimate the influence spread and select nodes with a greedy algorithm, or use a node-ranking heuristic. Nodes activate at different time points in the multiple seeding problem, via either sequential seeding, maintenance seeding or node probing paradigms. Throughout this review, we give special attention to deploying these algorithms in practice while also discussing existing solutions for real-world applications. We conclude by sharing important future research directions and challenges.Description
Publisher Copyright: © The Author(s) 2024.
Keywords
Diffusion, Dynamic networks, Graphs
Other note
Citation
Yanchenko, E, Murata, T & Holme, P 2024, ' Influence maximization on temporal networks : a review ', Applied Network Science, vol. 9, no. 1, 16, pp. 1-25 . https://doi.org/10.1007/s41109-024-00625-3
