Tracing Epidemic Source of Dynamic Network Based on Graph Neural Network

Identifying the source of an epidemic involves inferring its origin based on observations of the infected population, where timely isolation of the source is critical to mitigating outbreak spread. Existing approaches predominantly assume static network topologies, yet real-world networks exhibit dynamic changes in nodes and edges over time, significantly challenging conventional source detection methods designed for static networks. To address this limitation, we propose a dynamic network source detection framework based on a <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</u>ulti-observation <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u>ource <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">F</u>usion <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u>patio-<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</u>emporal <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</u>raph <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">C</u>onvolutional <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</u>etwork (MSF-STGCN). Our method first partitions epidemic data into multi-frame static graphs, distinguishing between observed and unobserved node states relative to the target detection time. Next, we leverage graph neural networks to extract spatio-temporal features from multi-snapshot sequence data. Finally, we introduce a dynamic message-passing algorithm to process unobserved network components and integrate the results with multi-snapshot spatio-temporal features for accurate source identification. Extensive experiments on synthetic networks and real-world datasets demonstrate the superior performance of our approach compared to state-of-the-art baselines.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Networking
Published
2025-09-16
DOI
https://doi.org/10.1109/ton.2025.3603678
Primary Topic
Geoscience and Mining Technology
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tracing Epidemic Source of Dynamic Network Based on Graph Neural Network

Xin Yan, Qiang He, Lu Chen, Jie Zhang et al.
IEEE Transactions on Networking
Geoscience and Mining Technology
article

Tracing Epidemic Source of Dynamic Network Based on Graph Neural Network

Xin Yan, Qiang He, Lu Chen, Jie Zhang, Hui Fang
article en

Abstract

Identifying the source of an epidemic involves inferring its origin based on observations of the infected population, where timely isolation of the source is critical to mitigating outbreak spread. Existing approaches predominantly assume static network topologies, yet real-world networks exhibit dynamic changes in nodes and edges over time, significantly challenging conventional source detection methods designed for static networks. To address this limitation, we propose a dynamic network source detection framework based on a <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</u>ulti-observation <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u>ource <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">F</u>usion <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u>patio-<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</u>emporal <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</u>raph <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">C</u>onvolutional <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</u>etwork (MSF-STGCN). Our method first partitions epidemic data into multi-frame static graphs, distinguishing between observed and unobserved node states relative to the target detection time. Next, we leverage graph neural networks to extract spatio-temporal features from multi-snapshot sequence data. Finally, we introduce a dynamic message-passing algorithm to process unobserved network components and integrate the results with multi-snapshot spatio-temporal features for accurate source identification. Extensive experiments on synthetic networks and real-world datasets demonstrate the superior performance of our approach compared to state-of-the-art baselines.

IEEE Transactions on NetworkingVol. 34
Nanyang Technological University (SG), Shanghai University of Finance and Economics (CN), Zhejiang University (CN), Northeastern University (CN)
Openalex Percentile: Top 70%
Geoscience and Mining Technology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.