The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Breakdown of interdependent directed networks
Open accessAbstract
Significance: Real-world complex systems interact with one another, and these interactions increase the probability of catastrophic failure. Using interdependent networks to model these phenomena helps understand a system’s robustness and enables design of more robust infrastructures. Previous research has been limited to an idealized case where each layer is undirected, but almost all real-world networks are directed and exhibit in-degree and out-degree correlations. Therefore, we develop a general theoretical framework for analyzing the breakdown of interdependent directed networks with, or without, in-degree and out-degree correlations, and apply it to real-world international trade networks. Surprisingly, we find that the robustness of interdependent heterogeneous networks increases, whereas that of interdependent homogeneous networks with strong coupling strengths decreases with in-degree and out-degree correlations.
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
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
Cited by
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Metadata
- Authors
- Liu, X., Stanley, H. E., & Gao, J.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2016-01-19
- Volume
- 113
- Issue
- 5
- Pages
- 1138-1143
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2258345980
- Cited by
- 182
- References
- 1
- FWCI
- 9.41
- 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: Breakdown of interdependent directed networks. https://app.cochat.ai/papers/10.1073/pnas.1523412113
- The paper
- Liu, X., Stanley, H. E., & Gao, J. (2016). Breakdown of interdependent directed networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1523412113
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.