Error and Attack Tolerance of Complex Networks¶
Albert, R., Jeong, H., & Barabási, A. (2000). Error and Attack Tolerance of Complex Networks. Nature, 406(6794), 378-382.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Percolation
- Network science. The connectivity of large networks under random or targeted node removal; the internet's robustness to random failure but fragility to targeted attack is a percolation problem on a heterogeneous-degree network.
This sourceShows scale-free networks (e.g., the internet) are robust to random failure but fragile to targeted hub removal — a percolation result on heterogeneous degree distributions.
SupportedVerified against the work's full text
Albert, Jeong and Barabasi show the Internet's scale-free, inhomogeneous topology survives random node loss but fragments under removal of hubs, analysed via cluster-size thresholds tied to percolation.
“Indeed, we find that the diameter of the Internet is unaffected by the random r emoval of as high as 2 .5% of the nodes”
- Network science. The connectivity of large networks under random or targeted node removal; the internet's robustness to random failure but fragility to targeted attack is a percolation problem on a heterogeneous-degree network.
- Percolation Threshold
- Computer networks — connectivity of a network whose nodes fail randomly transitions sharply at a critical failure fraction, the design target for fault-tolerant overlays and ad-hoc wireless routing.
This sourceConnectivity of a network under random versus targeted node failure transitions sharply at a critical failure fraction — robust-to-random, fragile-to-targeted.
Supported in partVerified against the work's full text
Shows a sharp critical failure fraction for exponential networks and attack, but scale-free networks under random failure show no threshold; overlays and wireless routing are not discussed.
“S displays a threshold-like behavior such that for f > f c”
- Computer networks — connectivity of a network whose nodes fail randomly transitions sharply at a critical failure fraction, the design target for fault-tolerant overlays and ad-hoc wireless routing.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 2 of 2 citations: 1 supported, 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:9bbe6eb2b251 · see in the full table