arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.06558cs.SI
收藏

复杂网络中用于中心性破坏的基于采样的攻击方法

Sampling-Based Attack for Centrality Disruption in Complex Networks

Fariba Afrin Irany, Soumya Sarakar, Animesh Mukherjee, Sanjukta Bhowmick

AI总结:

该研究提出基于采样的攻击模型测试复杂网络中心性排名韧性,引入通用的分散式富人俱乐部概念及雪球采样检测方法,在真实网络中验证了其高效识别子结构与破坏中心性排名的效果。

摘要:

许多移动网络被表示为图结构,以深入分析其连通性和传输特性。在这些特性中,中心性韧性(即接近中心性、介数中心性等中心性指标在攻击下的维持程度)是保障网络正常运行的关键因素。本文通过构建攻击模型来破坏基于路径的高中心性顶点的排名,以此研究复杂网络的中心性韧性。\n为构建攻击模型,我们将有影响力顶点的“富人俱乐部(rich club)”概念扩展到更通用的“分散式富人俱乐部(scattered rich clubs)”框架。我们将分散式富人俱乐部定义为分布(分散)在整个网络中的、由高中心性顶点构成的稠密子图。尽管查找分散式富人俱乐部的时间复杂度为多项式级,但其计算成本极高。我们采用雪球采样(snowball sampling)来识别这些重要子结构,同时确定所提出的攻击模型中需要靶向攻击的边。\n我们在一组真实世界网络上的实验结果表明,所提出的算法能够高效地找到单个或分散式富人俱乐部,并成功破坏网络的中心性排名。综上,我们提出了用于测试网络中心性排名韧性的基于采样的攻击模型;在此过程中,我们提出了富人俱乐部模型的通用形式——分散式富人俱乐部,以及检测它们的高效算法,并证明了其与网络韧性的关联。

英文摘要:

Many mobile networks are represented as graphs to obtain insight to their connectivity and transmission properties. Among these properties centrality resilience, that is, how well centralities, such as closeness and betweennesss, are maintained under attacks is a critical factor for proper functioning of a network. In this paper, we study the centrality resilience of complex networks by developing attack models to disrupt the rank of the top path-based centrality vertices. To develop our attack models, we extend the concept of rich clubs of influential vertices to the more general framework of scattered rich clubs. We define scattered rich clubs as dense subgraphs of high centrality vertices that are spread (scattered) across the network. Finding scattered rich clubs, although of polynomial time complexity, is extremely expensive computationally. We use snowball sampling to identify these important substructures as well as to identify which edges to target in our proposed attack models. Our results over a set of real world networks demonstrate that our proposed algorithm is effective in finding the single or scattered rich clubs efficiently and in successfully disrupting the centrality rankings of the network. To summarize, we propose sampling-based attack models for testing the resilience of networks with respect to centrality rankings. As part of this process, we introduce scattered rich clubs, a generalized form of the rich club model, efficient algorithms to detect them, and demonstrate their relation to network resilience.

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

↑