🕸️ Network Resilience

Scale-Free Networks · Targeted Hub Attack · Random Node Failure · Giant Component · Percolation

Network Setup

Scale-Free
Erdős–Rényi
Targeted
Random

Network Stats

Total nodes
Removed nodes0
Giant component
GC fraction
Components
Max degree (hub)
Scale-free networks (Barabási–Albert) have a few high-degree hubs. Targeted attacks on hubs rapidly fragment the network; random failures rarely hit critical hubs, so the giant component survives. This asymmetry explains internet and biological network robustness.