PeerJ . Detecting the outbreak of influenza based on the shortest path of dynamic city network

[tetano]

PeerJ


. 2020 Jul 20;8:e9432.
doi: 10.7717/peerj.9432. eCollection 2020.
Detecting the outbreak of influenza based on the shortest path of dynamic city network


Yingqi Chen ¹ , Kun Yang ¹ , Jialiu Xie ² , Rong Xie ³ , Zhengrong Liu ⁴ , Rui Liu ⁴ , Pei Chen ⁴



Affiliations

• PMID: 32742777
• PMCID: PMC7377247
• DOI: 10.7717/peerj.9432

Free PMC article

Abstract

The influenza pandemic causes a large number of hospitalizations and even deaths. There is an urgent need for an efficient and effective method for detecting the outbreak of influenza so that timely, appropriate interventions can be made to prevent or at least prepare for catastrophic epidemics. In this study, we proposed a computational method, the shortest-path-based dynamical network marker (SP-DNM), to detect the pre-outbreak state of influenza epidemics by monitoring the dynamical change of the shortest path in a city network. Specifically, by mapping the real-time information to a properly constructed city network, our method detects the early-warning signal prior to the influenza outbreak in both Tokyo and Hokkaido for consecutive 9 years, which demonstrate the effectiveness and robustness of the proposed method.

Keywords: Dynamic city network; Dynamic network marker; Influenza outbreak; Pre-outbreak state; The shortest path.