Graph-Based Reinforcement Learning for Minimizing Population Mortality in Epidemic Networks
- 8 June 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. PP (4) , 1-14
Abstract
The spread of infectious diseases in networked populations poses significant challenges for public health intervention strategies. Traditional centrality-based and heuristic network dismantling approaches prioritize highly connected nodes but often fail to account for individual mortality risk, limiting their effectiveness in minimizing overall fatalities. While recent advances in machine learning have improved intervention strategies, existing models largely focus on reducing disease transmission rather than directly targeting mortality outcomes. To address this gap, we propose a reinforcement learning-based framework that integrates graph representation learning to identify and remove high-risk nodes, thereby maximizing network fragmentation while minimizing overall deaths. The framework is trained using synthetic networks and evaluated on five synthetic and four real-world datasets, benchmarking its performance against state-of-the-art network dismantling methods [graph dismantling with machine learning (GDM), generalized network dismantling (GND), and graph enhanced reinforcement learning (GERL)]. Experimental results demonstrate that the proposed method consistently outperforms baseline approaches, particularly in scale-free and community-structured networks, where targeted node removal significantly weakens network connectivity and suppresses epidemic spread. Moreover, in real-world networks, the method achieves lower cumulative death rates and higher epidemic thresholds, highlighting its robustness in controlling disease propagation. By incorporating mortality risk into network representation learning, the proposed framework offers a scalable, adaptive, and socially responsible approach to epidemic mitigation, misinformation control, and network resilience enhancement.Keywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada (RGPIN-2026-04763)
- Simon Fraser University (N001210)
This publication has 46 references indexed in Scilit:
- Ranking the spreading capability of nodes in complex networks based on link significancePhysica A: Statistical Mechanics and its Applications, 2018
- The Critical Node Detection Problem in networks: A surveyComputer Science Review, 2018
- Mathematics of Epidemics on Networks2017
- Fast ranking influential nodes in complex networks using a k-shell iteration factorPhysica A: Statistical Mechanics and its Applications, 2016
- Identifying influential spreaders in complex networks based on gravity formulaPhysica A: Statistical Mechanics and its Applications, 2016
- Inferring social structure and its drivers from refuge use in the desert tortoise, a relatively solitary speciesBehavioral Ecology and Sociobiology, 2016
- Identifying influential nodes in complex networksPhysica A: Statistical Mechanics and its Applications, 2012
- Influential Nodes in a Diffusion Model for Social Networks2005
- Centrality in social networks conceptual clarificationSocial Networks, 1978
- The Centrality Index of a GraphPsychometrika, 1966