2 papers
cs.SI2026
Fair Influence Maximization in Hypergraphs
Zoë Abhelakh, Tianrui Mao, Huijuan Wang
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.…
cs.SI2025
Estimating Nodal Spreading Influence Using Partial Temporal Network
Tianrui Mao, Shilun Zhang, Alan Hanjalic +1
Temporal networks, whose links are activated or deactivated over time, are used to represent complex systems such as social interactions or collaborations occurring at specific tim…