The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimization of robustness of complex networks
Open accessAbstract
Abstract.Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random failure and intentional attack while keeping the cost of the network (which we take to be the average number of links per node) constant. We find optimal parameters for: (i) scale free networks having degree distributions with a single power-law regime, (ii) networks having degree distributions with two power-law regimes, and (iii) networks described by degree distributions containing two peaks. Of these various kinds of distributions we find that the optimal network design is one in which all but one of the nodes have the same degree, k1 (close to the average number of links per node), and one node is of very large degree, $k_2 \sim N^{2/3}$, where N is the number of nodes in the network.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Gao, H., Lam, J., & Chen, G. (2006) · Physics Letters A · doi:10.1016/j.physleta.2006.08.033 · Cited by 330
Multiple weak hits confuse complex systems: A transcriptional regulatory network as an example
Ágoston, V., Csermely, P., & Pongor, S. (2005) · Physical Review E · doi:10.1103/physreve.71.051909 · Cited by 111
Metadata
- Authors
- Paul, G., Tanizawa, T., Havlin, S., & Stanley, H. E.
- Venue
- The European Physical Journal B
- Published
- 2004-03
- Volume
- 38
- Issue
- 2
- Pages
- 187-191
- ISSN
- 1434-6028 (ISSN-L)
- 1434-6036
- OpenAlex
- W2110792417
- Cited by
- 197
- References
- 2
- FWCI
- 7.05
- Type
- journal article
- Language
- en
- Open access
- green
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: Optimization of robustness of complex networks. https://app.cochat.ai/papers/10.1140/epjb/e2004-00112-3
- The paper
- Paul, G., Tanizawa, T., Havlin, S., & Stanley, H. E. (2004). Optimization of robustness of complex networks. The European Physical Journal B. https://doi.org/10.1140/epjb/e2004-00112-3
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.