The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Effect of the interconnected network structure on the epidemic threshold
Open accessAbstract
Most real-world networks are not isolated. In order to function fully, they are interconnected with other networks, and this interconnection influences their dynamic processes. For example, when the spread of a disease involves two species, the dynamics of the spread within each species (the contact network) differs from that of the spread between the two species (the interconnected network). We model two generic interconnected networks using two adjacency matrices, A and B, in which A is a $2N\ifmmode\times\else\texttimes\fi{}2N$ matrix that depicts the connectivity within each of two networks of size $N$, and B a $2N\ifmmode\times\else\texttimes\fi{}2N$ matrix that depicts the interconnections between the two. Using an $N$-intertwined mean-field approximation, we determine that a critical susceptible-infected-susceptible (SIS) epidemic threshold in two interconnected networks is $1/{\ensuremath{\lambda}}_{1}(A+\ensuremath{\alpha}B)$, where the infection rate is $\ensuremath{\beta}$ within each of the two individual networks and $\ensuremath{\alpha}\ensuremath{\beta}$ in the interconnected links between the two networks and ${\ensuremath{\lambda}}_{1}(A+\ensuremath{\alpha}B)$ is the largest eigenvalue of the matrix $A+\ensuremath{\alpha}B$. In order to determine how the epidemic threshold is dependent upon the structure of interconnected networks, we analytically derive ${\ensuremath{\lambda}}_{1}(A+\ensuremath{\alpha}B)$ using a perturbation approximation for small and large $\ensuremath{\alpha}$, the lower and upper bound for any $\ensuremath{\alpha}$ as a function of the adjacency matrix of the two individual networks, and the interconnections between the two and their largest eigenvalues and eigenvectors. We verify these approximation and boundary values for ${\ensuremath{\lambda}}_{1}(A+\ensuremath{\alpha}B)$ using numerical simulations, and determine how component network features affect ${\ensuremath{\lambda}}_{1}(A+\ensuremath{\alpha}B)$. We note that, given two isolated networks ${G}_{1}$ and ${G}_{2}$ with principal eigenvectors $x$ and $y$, respectively, ${\ensuremath{\lambda}}_{1}(A+\ensuremath{\alpha}B)$ tends to be higher when nodes $i$ and $j$ with a higher eigenvector component product ${x}_{i}{y}_{j}$ are interconnected. This finding suggests essential insights into ways of designing interconnected networks to be robust against epidemics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Largest Eigenvalue of Sparse Random Graphs
KRIVELEVICH, M., & SUDAKOV, B. (2003) · Combinatorics, Probability and Computing · doi:10.1017/s0963548302005424 · Cited by 207
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Statistical physics of vaccination
Wang, Z., Bauch, C. T., Bhattacharyya, S., d'Onofrio, A., Manfredi, P., Perc, M., Perra, N., Salathé, M., & Zhao, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.006 · Cited by 872
Analytical Computation of the Epidemic Threshold on Temporal Networks
Valdano, E., Ferreri, L., Poletto, C., & Colizza, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.021005 · Cited by 187
Metadata
- Authors
- Wang, H., Li, Q., D’Agostino, G., Havlin, S., Stanley, H. E., & Van Mieghem, P.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2013-08-02
- Volume
- 88
- Issue
- 2
- Pages
- 022801-022801
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2067268428
- Cited by
- 195
- References
- 1
- FWCI
- 16.50
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Effect of the interconnected network structure on the epidemic threshold. https://app.cochat.ai/papers/10.1103/physreve.88.022801
- The paper
- Wang, H., Li, Q., D’Agostino, G., Havlin, S., Stanley, H. E., & Van Mieghem, P. (2013). Effect of the interconnected network structure on the epidemic threshold. Physical Review E. https://doi.org/10.1103/physreve.88.022801
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.