Representation of degree correlation using eigenvalue decomposition and its application to epidemic models
arXiv:2308.05611 · doi:10.1093/ptep/ptad132
Abstract
Degree correlation plays a crucial role in studying network structures; however, its varied forms pose challenges to understanding its impact on network dynamics. This study devised a method that uses eigenvalue decomposition to characterize degree correlations. Additionally, the applicability of this method was demonstrated by approximating the basic and type reproduction numbers in an epidemic network model. The findings elucidate the interplay between degree correlations and epidemic behavior, thus contributing to a deeper understanding of complex networks and their dynamics.
arXiv comment5 pages, 3 figures
References in corpus (14)
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Epidemic processes in complex networks
- Critical phenomena in complex networks
- Dynamical and correlation properties of the Internet
- Epidemic spreading in correlated complex networks
- Absence of epidemic threshold in scale-free networks with connectivity correlations
- Localization and Spreading of Diseases in Complex Networks
- Fundamentals of spreading processes in single and multilayer complex networks
- The origin of degree correlations in the Internet and other networks
- Epidemic Incidence in Correlated Complex Networks
- Fundamental statistical features and self-similar properties of tagged networks
- Six Susceptible-Infected-Susceptible Models on Scale-free Networks
- Solvable epidemic model on degree-correlated networks