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.
- 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.
- 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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:9bbe6eb2b251 · see in the full table