arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.4283physics.soc-phcond-mat.dis-nn
收藏

度相关节点移除代价约束下的网络抗智能攻击弹性

Network resilience against intelligent attacks constrained by degree dependent node removal cost

A Annibale, A C C Coolen, G Bianconi

摘要:

我们研究了复杂网络对攻击的弹性,其中节点被智能地定位,但是禁用节点对攻击者有成本,这取决于它的程度。攻击者必须用有限的资源来支付这些成本,这限制了他们的行动。网络的完整性是根据它所支持的过程的有效性来量化的。我们计算了最优攻击策略和最抗攻击的网络度统计量如何依赖于节点移除成本函数和攻击资源。网络对智能攻击的恢复能力强烈依赖于攻击者所面临的节点移除代价函数。特别是,如果节点删除成本增加足够快的节点度,幂律网络被发现比泊松网络更有弹性,即使是对优化的智能攻击。

英文摘要:

We study the resilience of complex networks against attacks in which nodes are targeted intelligently, but where disabling a node has a cost to the attacker which depends on its degree. Attackers have to meet these costs with limited resources, which constrains their actions. A network's integrity is quantified in terms of the efficacy of the process that it supports. We calculate how the optimal attack strategy and the most attack-resistant network degree statistics depend on the node removal cost function and the attack resources. The resilience of networks against intelligent attacks is found to depend strongly on the node removal cost function faced by the attacker. In particular, if node removal costs increase sufficiently fast with the node degree, power law networks are found to be more resilient than Poissonian ones, even against optimized intelligent attacks.

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

↑