Influence Maximization for Fixed Heterogeneous Thresholds
Panagiotis D. Karampourniotis, Boleslaw K. Szymanski, Gyorgy Korniss

TL;DR
This paper introduces two novel influence maximization metrics, BI and GPI, which effectively identify key nodes in networks for spreading influence, tested on the Linear Threshold Model with fixed thresholds.
Contribution
The paper presents two new influence maximization metrics, BI and GPI, applicable to various cascade models, with demonstrated strong performance on fixed threshold networks.
Findings
BI and GPI outperform existing methods in influence spread.
Network degree assortativity affects cascade size.
Threshold distribution impacts influence maximization effectiveness.
Abstract
Influence Maximization is a NP-hard problem of selecting the optimal set of influencers in a network. Here, we propose two new approaches to influence maximization based on two very different metrics. The first metric, termed Balanced Index (BI), is fast to compute and assigns top values to two kinds of nodes: those with high resistance to adoption, and those with large out-degree. This is done by linearly combining three properties of a node: its degree, susceptibility to new opinions, and the impact its activation will have on its neighborhood. Controlling the weights between those three terms has a huge impact on performance. The second metric, termed Group Performance Index (GPI), measures performance of each node as an initiator when it is a part of randomly selected initiator set. In each such selection, the score assigned to each teammate is inversely proportional to the number…
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.
