论文标题
网络鲁棒性重新审视
Network Robustness Revisited
论文作者
论文摘要
复杂网络的鲁棒性是网络科学成立后研究的第一个现象之一。但是，该理论的许多当代演讲并不超出原始论文。在这里，我们重新审视此主题，目的是提供深刻而教学的介绍。我们特别注意通常忽略的巨型组件大小的计算中的某些并发症。按照直观的步骤，我们得出简单的公式，以捕获常见攻击方案对任意（配置模型）网络的影响。我们希望这种温和但数学上的介绍能够帮助新的研究人员发现这一美丽的网络科学领域。
The robustness of complex networks was one of the first phenomena studied after the inception of network science. However, many contemporary presentations of this theory do not go beyond the original papers. Here we revisit this topic with the aim of providing a deep but didactic introduction. We pay particular attention to some complications in the computation of giant component sizes that are commonly ignored. Following an intuitive procedure, we derive simple formulas that capture the effect of common attack scenarios on arbitrary (configuration model) networks. We hope that this gentle but mathematically-grounded introduction will help new researchers discover this beautiful area of network science.
