Abstract:The influence maximization problem aims to select a set of seed nodes that maximize the influence, i.e., the average number of influenced nodes, at the end of a spreading process. It has been widely studied with applications in viral marketing, public health campaigns, and social influence. In networks with pronounced community structure, existing approaches often yield an uneven distribution of influenced nodes across communities, which is unfair. Although the fair influence maximization (FIM) problem has been studied for pairwise networks, it remains largely unexplored for hyper graphs, which more accurately represent real-world systems involving group interactions. We introduce FIMH, a heuristic seed-selection algorithm for FIM on hyper graphs, under the Susceptible-Infected Contact Process (SICP) spreading model. FIMH iteratively estimates the contribution of each candidate node to influence and fairness and selects the node that best trades off these two objectives as an additional seed using a parameter-free utopia-distance criterion. Experiments on seven real-world hypergraphs demonstrate that FIMH achieves an influence comparable to that of state-of-the-art IM methods while significantly reducing influence disparity. Analysis of the topological properties of the selected seed nodes and their contributions to influence and fairness further supports the effectiveness of FIMH.
From: Zoë Abhelakh [view email]
[v1]
Fri, 12 Jun 2026 07:12:14 UTC (3,578 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。