无标度网络的比较弹性概念和顶点攻击容忍度
Comparative Resilience Notions and Vertex Attack Tolerance of Scale-Free Networks
摘要:
我们关注的是一个适当的数学措施的弹性在面对有针对性的节点攻击任意度的网络,随后比较不同的无标度网络模型的弹性与建议的措施。我们强烈激励我们的弹性措施称为\emph{vertex attack tolerance}(增值税),这是数学表示为$τ(G) = \min_{S \subset V} \frac{|S|}{|V-S-C_{max}(V-S)|+1}$,其中$C_{max}(V-S)$是最大的连接组件在$V-S$。我们试图彻底比较增值税与几个现有的弹性概念:电导,顶点扩张,完整性,韧性,韧性和散射数。我们的比较表明,对于artbitrary度分布增值税是唯一的措施,完全捕获的主要\emph{bottlenecks}的网络和所产生的\emph{component size distribution}后,有针对性的节点攻击(都捕获的方式成比例的攻击集的大小)。对于$d$ -正则图,我们证明了$τ(G) \le dΦ(G)$,其中$Φ(G)$是图$G$的电导.在规则图的情况下,传导性和扩展性是鲁棒性和瓶颈的充分研究的度量,但在高度异构度图的情况下,它们无法捕获弹性。关于不同的无标度图模型的比较,我们的实验结果表明,PLOD图的度分布相同的BA图相同的大小表现出一贯更好的顶点攻击容忍度比BA型图,虽然这两种图形类型出现渐近弹性BA生成参数$m = 2$。带有$m = 1$的BA图似乎也缺乏弹性,不仅表现出非常低的增值税值,而且在识别脆弱节点集(即枢纽)时具有很高的透明度,这与众所周知的先前工作一致。
英文摘要:
We are concerned with an appropriate mathematical measure of resilience in the face of targeted node attacks for arbitrary degree networks, and subsequently comparing the resilience of different scale-free network models with the proposed measure. We strongly motivate our resilience measure termed \emph{vertex attack tolerance} (VAT), which is denoted mathematically as $τ(G) = \min_{S \subset V} \frac{|S|}{|V-S-C_{max}(V-S)|+1}$, where $C_{max}(V-S)$ is the largest connected component in $V-S$. We attempt a thorough comparison of VAT with several existing resilience notions: conductance, vertex expansion, integrity, toughness, tenacity and scattering number. Our comparisons indicate that for artbitrary degree distributions VAT is the only measure that fully captures both the major \emph{bottlenecks} of a network and the resulting \emph{component size distribution} upon targeted node attacks (both captured in a manner proportional to the size of the attack set). For the case of $d$-regular graphs, we prove that $τ(G) \le dΦ(G)$, where $Φ(G)$ is the conductance of the graph $G$. Conductance and expansion are well-studied measures of robustness and bottlenecks in the case of regular graphs but fail to capture resilience in the case of highly heterogeneous degree graphs. Regarding comparison of different scale-free graph models, our experimental results indicate that PLOD graphs with degree distributions identical to BA graphs of the same size exhibit consistently better vertex attack tolerance than the BA type graphs, although both graph types appear asymptotically resilient for BA generative parameter $m = 2$. BA graphs with $m = 1$ also appear to lack resilience, not only exhibiting very low VAT values, but also great transparency in the identification of the vulnerable node sets, namely the hubs, consistent with well known previous work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。