Adaptive overlap penalization and probabilistic modeling in hypergraph influence maximization
- 3 January 2026
- journal article
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (62173095)
- National Natural Science Foundation of China (U23A20331)
- National Natural Science Foundation of China (Grant62573133)
This publication has 32 references indexed in Scilit:
- Finding influential nodes via graph embedding and hybrid centrality in complex networksChaos, Solitons & Fractals, 2025
- Deep reinforcement learning-based influence maximization for heterogeneous hypergraphsPhysica A: Statistical Mechanics and its Applications, 2025
- Influence maximization in hypergraphs based on evolutionary deep reinforcement learningInformation Sciences, 2024
- EIOA: A computing expectation-based influence evaluation method in weighted hypergraphsInformation Processing & Management, 2024
- Influence maximization on hypergraphs via multi-hop influence estimationInformation Processing & Management, 2024
- Influence maximization in hypergraphs: A self-optimizing algorithm based on electrostatic fieldChaos, Solitons & Fractals, 2023
- An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphsInformation Processing & Management, 2022
- Vector centrality in hypergraphsChaos, Solitons & Fractals, 2022
- Influence maximization in social networks using graph embedding and graph neural networkInformation Sciences, 2022
- Information spreading dynamics in hypernetworksPhysica A: Statistical Mechanics and its Applications, 2018