正则图的点攻击容限
On Vertex Attack Tolerance in Regular Graphs
摘要:
我们之前已经介绍了顶点攻击容忍度(VAT),在数学上表示为$τ(G) = \min_{S \subset V} \frac{|S|}{|V-S-C_{max}(V-S)|+1}$,其中$C_{max}(V-S)$是$V-S$中最大的连接组件,作为任意度网络面对目标节点攻击时弹性的适当数学度量。VAT的一部分动机是观察到,而电导,$Φ(G)$,捕获基于边缘和基于节点的弹性规则图,电导未能捕获基于节点的弹性异构度分布。我们先前已经证明了一个上限增值税通过电导的情况下$d$ -定期图$G$如下:$τ(G) \le dΦ(G)$如果$Φ(G) \le \frac{1}{d^2}$和$τ(G) \le d^2Φ(G)$否则。在这项工作中,我们提供了一个新的匹配下界:$τ(G) \ge \frac{1}{d}Φ(G)$。结合下界和上界表明,$τ(G) = Θ(Φ(G))$的正则常数度$d$和产量谱界的推论。
英文摘要:
We have previously introduced vertex attack tolerance (VAT), 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$, as an appropriate mathematical measure of resilience in the face of targeted node attacks for arbitrary degree networks. A part of the motivation for VAT was the observation that, whereas conductance, $Φ(G)$, captures both edge based and node based resilience for regular graphs, conductance fails to capture node based resilience for heterogeneous degree distributions. We had previously demonstrated an upper bound on VAT via conductance for the case of $d$-regular graphs $G$ as follows: $τ(G) \le dΦ(G)$ if $Φ(G) \le \frac{1}{d^2}$ and $τ(G) \le d^2Φ(G)$ otherwise. In this work, we provide a new matching lower bound: $τ(G) \ge \frac{1}{d}Φ(G)$. The lower and upper bound combined show that $τ(G) = Θ(Φ(G))$ for regular constant degree $d$ and yield spectral bounds as corollaries.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。