Structural Vulnerability Analysis of Overlapping Communities in Complex Networks

被引:6
|
作者
Alim, Md Abdul [1 ]
Nguyen, Nam P. [2 ]
Dinh, Thang N. [3 ]
Thai, My T. [1 ]
机构
[1] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL 32611 USA
[2] Towson Univ, Dept Comp & Informat Sci, Towson, MD USA
[3] Virginia Commonwealth Univ, Dept Comp Sci, Richmond, VA 23284 USA
关键词
D O I
10.1109/WI-IAT.2014.10
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many complex networks commonly exhibit community structure in their underlying organizations, i.e., they contain multiple groups of nodes having more connections inside a group and less interactions among groups. This special structure not only offers key insights into understanding the network organization principles but also plays a vital role in maintaining the normal function of the whole system. As a result, any significant change to the network communities, due to element-wise failures, can potentially redefine their organizational structures and consequently lead to the malfunction or undesirable corruption of the entire system. Therefore, identifying network elements that are essential to its community structure is a fundamental and important problem. However, to the best of our knowledge, this research direction has not received much been attention in the literature. In this paper, we study the structural vulnerability of overlapping complex network communities to identify nodes that are important in maintaining the complex structure organization. Specifically, given a network and a budget of k nodes, we want to identify k critical nodes whose their exclusions transforms the current network community structure. To effectively analyze this vulnerability on overlapping communities, we propose the concept of generating edges and provide an optimal algorithm for detecting the Minimal Generating Edge Set (MGES) in a network community. We suggest genEdge, an effective solution based on this MGES. Empirical results on both synthesized networks with known community structures, and real data including Reality cellular data, Foursquare and Facebook social traces confirm the efficacy of our approach.
引用
收藏
页码:5 / 12
页数:8
相关论文
共 50 条
  • [21] Uncovering complex overlapping pattern of communities in large-scale social networks
    Xu, Elvis H. W.
    Hui, Pak Ming
    APPLIED NETWORK SCIENCE, 2019, 4 (01)
  • [22] Detecting overlapping communities in complex networks using non-cooperative games
    Ferdowsi F.
    Aghababaei Samani K.
    Scientific Reports, 12 (1)
  • [23] An improved limited random walk approach for identification of overlapping communities in complex networks
    Sondos Bahadori
    Parham Moradi
    Hadi Zare
    Applied Intelligence, 2021, 51 : 3561 - 3580
  • [24] A Markov random walk under constraint for discovering overlapping communities in complex networks
    Jin, Di
    Yang, Bo
    Baquero, Carlos
    Liu, Dayou
    He, Dongxiao
    Liu, Jie
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2011,
  • [25] Combined node and link partitions method for finding overlapping communities in complex networks
    Jin, Di
    Gabrys, Bogdan
    Dang, Jianwu
    SCIENTIFIC REPORTS, 2015, 5
  • [26] An improved limited random walk approach for identification of overlapping communities in complex networks
    Bahadori, Sondos
    Moradi, Parham
    Zare, Hadi
    APPLIED INTELLIGENCE, 2021, 51 (06) : 3561 - 3580
  • [27] Algorithm for discovering overlapping communities in parallel complex networks based on label propagation
    Xu, Xiaoyuan
    Huang, Li
    BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2020, 127 : 198 - 199
  • [28] Combined node and link partitions method for finding overlapping communities in complex networks
    Di Jin
    Bogdan Gabrys
    Jianwu Dang
    Scientific Reports, 5
  • [29] CONTAGIONS IN RANDOM NETWORKS WITH OVERLAPPING COMMUNITIES
    Coupechoux, Emilie
    Lelarge, Marc
    ADVANCES IN APPLIED PROBABILITY, 2015, 47 (04) : 973 - 988
  • [30] Finding overlapping communities in multilayer networks
    Liu, Weiyi
    Suzumura, Toyotaro
    Ji, Hongyu
    Hu, Guangmin
    PLOS ONE, 2018, 13 (04):