Epidemic threshold : a Laplacian spectral and structural approach of prediction
- 1 December 2025
- journal article
- research article
- Published by Springer Nature in Theory in Biosciences
- Vol. 145 (1) , 1
Abstract
In epidemiology studies, control processes are driven by key parameters, such as \(R_0\), the epidemic threshold \(\tau\) over a contact network. By network-based models, the knowledge of network structures improves the prediction of \(\tau\), which is a challenge using structural features of a contact network. There are several structural approaches to predict \(\tau\). The common QMF (Quenched Mean-Field) approach uses the spectral radius as a single parameter. However, prediction can be improved using the node number, spectral radius, and Laplacian energy of graph. In this paper, at different levels, we design and experiment a new structural and spectral prediction approach of \(\tau\) called KSEL (K Spectral Energy of Laplacian). Theoretical and formal levels establish mathematical foundations, while qualitative, quantitative, and comparative levels compute a descriptive statistics summary, some data analytics, and visualisation through a large and heterogeneous dataset. Results show that the new approach effectively predicts \(\tau\). It captures the full network structure, connectivity, and network diffusion features. KSEL is similar, shares a common rolling trend, and performs really good compared to the previous structural prediction approaches, including the most commonly used QMF. There is a strong positive correlation and similar value distribution between KSEL and the previous structural prediction approaches that accepted the null hypothesis by ANOVA analysis. Therefore, the new approach is structurally enriched; it extends the structural and spectral area to analyse and control spreading processes over a network. The results can have practical interests to advise an effective epidemiological control policy.
Keywords
This publication has 26 references indexed in Scilit:
- Predicting epidemic threshold in complex networks by graph neural networkChaos: An Interdisciplinary Journal of Nonlinear Science, 2024
- Time-dependent solution of the NIMFA equations around the epidemic thresholdJournal of Mathematical Biology, 2020
- Efficient algorithms based on centrality measures for identification of top-K influential users in social networksInformation Sciences, 2020
- Unification of theoretical approaches for epidemic spreading on complex networksReports on Progress in Physics, 2017
- Python for Graph and Network Analysis2017
- Eight challenges for network epidemic modelsEpidemics, 2015
- Graph Energy2012
- Spectral Graph Theory1996
- D. M. Cvetković, M. Doob and H. Sachs Spectra of graphs (3rd edition) (Johann Ambrosius Barth Verlag, Heidelberg-Leipzig 1995), 447 pp., 3 335 00407 8, DM 168.Proceedings of the Edinburgh Mathematical Society, 1996
- Algebraic Graph Theory1974