论文标题
您的网络有多脆弱？比你想象的要多
How fragile is your network? More than you think
论文作者
论文摘要
与生物学，互联网和基础架构以及许多其他应用相关的日常生活中，图表无处不在。因此，必须了解图形分解的速度，无论是通过随机故障还是通过目标攻击。尽管对该主题的大部分兴趣集中在靶向去除节点上，但最近对目标边缘去除有一些兴趣。在这里，我们专注于图形对边去除的稳健性。我们定义了一个网络脆弱性的度量，该量度将移动的边缘的比例与最大的连接组件相关联。我们构造了一类图形，这些图形可用于边缘去除。此外，证明图通常比贪婪的目标攻击所预期的要快。最后，这表明我们的脆弱性测量是证明是真实和自然网络的。
Graphs are pervasive in our everyday lives, with relevance to biology, the internet, and infrastructure, as well as numerous other applications. It is thus necessary to have an understanding as to how quickly a graph disintegrates, whether by random failure or by targeted attack. While much of the interest in this subject has been focused on targeted removal of nodes, there has been some recent interest in targeted edge removal. Here, we focus on how robust a graph is against edge removal. We define a measure of network fragility that relates the fraction of edges removed to the largest connected component. We construct a class of graphs that is robust to edge removal. Furthermore, it is demonstrated that graphs generally disintegrate faster than would be anticipated by greedy targeted attack. Finally it is shown that our fragility measure as demonstrated real and natural networks.
