The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Edge overload breakdown in evolving networks
Open accessAbstract
We investigate growing networks based on Barabási and Albert's algorithm for generating scale-free networks, but with edges sensitive to overload breakdown. The load is defined through edge betweenness centrality. We focus on the situation where the average number of connections per vertex is, like the number of vertices, linearly increasing in time. After an initial stage of growth, the network undergoes avalanching breakdowns to a fragmented state from which it never recovers. This breakdown is much less violent if the growth is by random rather than by preferential attachment (as defines the Barabási and Albert model). We briefly discuss the case where the average number of connections per vertex is constant. In this case no breakdown avalanches occur. Implications to the growth of real-world communication networks are discussed.
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
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Modeling cascading failures in the North American power grid
Kinney, R., Crucitti, P., Albert, R., & Latora, V. (2005) · The European Physical Journal B · doi:10.1140/epjb/e2005-00237-9 · Cited by 710
Efficient routing on complex networks
Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., & Wang, B.-H. (2006) · Physical Review E · doi:10.1103/physreve.73.046108 · Cited by 631
Amaral, L. A. N., & Ottino, J. M. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00110-5 · Cited by 493
Metadata
- Authors
- Holme, P.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-09-19
- Volume
- 66
- Issue
- 3
- Pages
- 036119-036119
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2073512688
- Cited by
- 209
- References
- 2
- FWCI
- 4.39
- 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: Edge overload breakdown in evolving networks. https://app.cochat.ai/papers/10.1103/physreve.66.036119
- The paper
- Holme, P. (2002). Edge overload breakdown in evolving networks. Physical Review E. https://doi.org/10.1103/physreve.66.036119
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.