DeepSN: A Sheaf Neural Framework for Influence Maximization
Asela Hevapathige, Qing Wang, Ahad N. Zehmakan
TL;DR
This work tackles influence maximization by marrying a diffusion process defined on sheaves with reaction dynamics, yielding a learning-based diffusion model that captures complex influence patterns. The two-phase DeepSN framework first learns influence propagation with a novel Sheaf GNN and then reduces seed-search complexity via a subgraph-based objective, guided by learned connectivity from sheaf coefficients. Empirically, DeepSN outperforms strong baselines across IC, LT, and SIS on both real and synthetic networks, with notable improvements under non-progressive SIS dynamics and clear gains from the reaction terms and subgraph strategy. The approach advances practical IM by enabling data-driven, topology-aware diffusion modeling and scalable seed selection, with potential impact on viral marketing, information spread, and network interventions.
Abstract
Influence maximization is key topic in data mining, with broad applications in social network analysis and viral marketing. In recent years, researchers have increasingly turned to machine learning techniques to address this problem. They have developed methods to learn the underlying diffusion processes in a data-driven manner, which enhances the generalizability of the solution, and have designed optimization objectives to identify the optimal seed set. Nonetheless, two fundamental gaps remain unsolved: (1) Graph Neural Networks (GNNs) are increasingly used to learn diffusion models, but in their traditional form, they often fail to capture the complex dynamics of influence diffusion, (2) Designing optimization objectives is challenging due to combinatorial explosion when solving this problem. To address these challenges, we propose a novel framework, DeepSN. Our framework employs sheaf neural diffusion to learn diverse influence patterns in a data-driven, end-to-end manner, providing enhanced separability in capturing diffusion characteristics. We also propose an optimization technique that accounts for overlapping influence between vertices, which helps to reduce the search space and identify the optimal seed set effectively and efficiently. Finally, we conduct extensive experiments on both synthetic and real-world datasets to demonstrate the effectiveness of our framework.
