Background
From the internet to power grids and shipping networks, our world relies on complex networks. Topological robustness theory quantifies a network’s ability to maintain connectivity and function despite random failures or targeted attacks.
Core Theory
1. Network Metrics
- Degree Distribution $P(k)$
- Algebraic Connectivity (Fiedler Value) $\lambda_2$. A larger $\lambda_2$ indicates stronger connectivity and faster information spread.
2. Percolation Theory & Thresholds
Random failures are modeled as a percolation process. For scale-free networks ($P(k) \sim k^{-\gamma}$), the critical threshold $p_c \to 0$ for $\gamma \le 3$, meaning they are robust to random failure but vulnerable to targeted attacks.
Figure
Figure 1: Heatmap showing node centrality and simulated fragmentation under hub removal.