Graph Neural Networks for Influence Maximization in Social Networks: An Unsupervised Minimum Dominating Set Approach

arXiv:2609.13836 · cs.LG, cs.SI · Submitted 2026-09-12 · Read on arXiv

cs.LG, cs.SI

Submitted: 2026-09-12

Updated: 2026-09-12

Comments: 16 pages, 1 figure, 4 tables. Submitted to the International Journal of Data Science and Analytics

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Minimum Dominating Set — 2× in this paper
• Benchmark — 1× in this paper · explained in 2 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• GNNs — 1× in this paper · explained in 2 episodes
• Graph Neural Networks (GNNs) — 1× in this paper · explained in 7 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks