arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.12779cond-mat.stat-mechphysics.comp-ph
收藏

介数中心攻击下二维随机格的爆炸拆解

Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks

Nahuel Almeira, Juan Ignacio Perotti, Andres Chacoma, Orlando Vito Billoni

摘要:

本文研究了二维随机格(Delaunay三角剖分)在介数中心攻击下的鲁棒性。连同这个中心性度量的标准定义,我们采用了一个范围有限的近似称为$\ell$ -介数,其中路径具有超过$\ell$步骤被忽略。对于有限的$\ell$,攻击产生连续的渗流转换,属于随机渗流的普适类。另一方面,在全范围介数下的攻击引起不连续的过渡,在热力学极限下,在移除子广泛的节点量之后发生。如果允许截止值随着网络的线性长度比$\ell\sim L^{0.91}$更快地缩放,则$\ell$ -介数的这种行为被恢复。我们的研究结果表明,介数中心编码信息的网络鲁棒性在所有尺度上,因此不能近似使用有限范围的计算,而不会失去攻击效率。

英文摘要:

In the present paper, we study the robustness of two-dimensional random lattices (Delaunay triangulations) under attacks based on betweenness centrality. Together with the standard definition of this centrality measure, we employ a range-limited approximation known as $\ell$-betweenness, where paths having more than $\ell$ steps are ignored. For finite $\ell$, the attacks produce continuous percolation transitions that belong to the universality class of random percolation. On the other hand, the attack under the full range betweenness induces a discontinuous transition that, in the thermodynamic limit, occurs after removing a sub-extensive amount of nodes. This behavior is recovered for $\ell$-betweenness if the cutoff is allowed to scale with the linear length of the network faster than $\ell\sim L^{0.91}$. Our results suggest that betweenness centrality encodes information on network robustness at all scales, and thus cannot be approximated using finite-ranged calculations without losing attack efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑