TY - JOUR
T1 - Timing matters
T2 - Influence maximization in social networks through scheduled seeding
AU - Goldenberg, Dmitri
AU - Sela, Alon
AU - Shmueli, Erez
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2018/9
Y1 - 2018/9
N2 - One highly studied topic in the field of social networks is the search for influential nodes that, when seeded (i.e., activated intentionally), may further activate a large portion of the network through a viral contagion process. Indeed, various mathematical models were proposed in the literature to characterize the dynamics of such diffusion processes, and different solutions were suggested for maximizing influence under such models. However, most of these solutions focused on selecting a set of nodes to be seeded at the initial phase of the diffusion process. This paper suggests a scheduled seeding approach that aims at finding not only the best set of nodes to be seeded but also the right timing to perform these seedings. More specifically, we identify three different properties of existing contagion models that can be utilized by a scheduled approach to improve the total number of activated nodes: 1) stochastic dynamics; 2) diminishing social effect; and 3) state-dependent seeding. By analyzing each of these properties separately, we demonstrate the advantages of the scheduled seeding approach over the traditional initial seeding approach, both by theoretical and empirical evaluation. Our analysis presents an improvement of 10%-70% in the final number of infected nodes when using the scheduled seeding approach. Our findings have the potential to open up a new area of research, focusing on finding the right timing for seeding actions, thereby helping both in improving our understanding of information diffusion dynamics and in devising better strategies for influence maximization.
AB - One highly studied topic in the field of social networks is the search for influential nodes that, when seeded (i.e., activated intentionally), may further activate a large portion of the network through a viral contagion process. Indeed, various mathematical models were proposed in the literature to characterize the dynamics of such diffusion processes, and different solutions were suggested for maximizing influence under such models. However, most of these solutions focused on selecting a set of nodes to be seeded at the initial phase of the diffusion process. This paper suggests a scheduled seeding approach that aims at finding not only the best set of nodes to be seeded but also the right timing to perform these seedings. More specifically, we identify three different properties of existing contagion models that can be utilized by a scheduled approach to improve the total number of activated nodes: 1) stochastic dynamics; 2) diminishing social effect; and 3) state-dependent seeding. By analyzing each of these properties separately, we demonstrate the advantages of the scheduled seeding approach over the traditional initial seeding approach, both by theoretical and empirical evaluation. Our analysis presents an improvement of 10%-70% in the final number of infected nodes when using the scheduled seeding approach. Our findings have the potential to open up a new area of research, focusing on finding the right timing for seeding actions, thereby helping both in improving our understanding of information diffusion dynamics and in devising better strategies for influence maximization.
KW - Influence maximization
KW - scheduling
KW - social networks
UR - http://www.scopus.com/inward/record.url?scp=85051044712&partnerID=8YFLogxK
U2 - 10.1109/TCSS.2018.2852742
DO - 10.1109/TCSS.2018.2852742
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85051044712
SN - 2329-924X
VL - 5
SP - 621
EP - 638
JO - IEEE Transactions on Computational Social Systems
JF - IEEE Transactions on Computational Social Systems
IS - 3
M1 - 8424548
ER -