Assessing the Structural Vulnerability of Online Social Networks in Empirical Data

被引:0
作者
Zhang, Dayong [1 ,2 ]
Guo, Changyong [3 ]
Zhang, Zhaoxin [3 ]
Long, Gang [3 ,4 ]
机构
[1] Peoples Online, State Key Lab Commun Content Cognit, Beijing, Peoples R China
[2] Harbin Inst Technol, Dept New Media & Arts, Harbin, Peoples R China
[3] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin, Peoples R China
[4] China Informat Technol Secur Evaluat Ctr, Beijing, Peoples R China
基金
黑龙江省自然科学基金;
关键词
online social network; vulnerability; structural property; centrality index; vulnerability assessment; COMPLEX NETWORKS; ATTACK TOLERANCE; LARGE-SCALE; CENTRALITY; BEHAVIOR; ERROR;
D O I
10.3389/fphy.2021.733224
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Assessing the structural vulnerability of online social networks has been one of the most engaging topics recently, which is quite essential and beneficial to holding the network connectivity and facilitating information flow, but most of the existing vulnerability assessment measures and the corresponding solutions fail to accurately reveal the global damage done to the network. In order to accurately measure the vulnerability of networks, an invulnerability index based on the concept of improved tenacity is proposed in the present study. Compared with existing measurements, the new method does not measure a single property performance, such as giant component size or the number of components after destruction, but pays special attention to the potential equilibrium between the removal cost and the removal effect. Extensive experiments on real-world social networks demonstrate the accuracy and effectiveness of the proposed method. Moreover, compared with results of attacks based on the different centrality indices, we found an individual node's prominence in a network is inherently related to the structural properties of network. In high centralized networks, the nodes with higher eigenvector are more important than the others in maintaining stability and connectivity. But in low centralized networks, the nodes with higher betweenness are more powerful than the others. In addition, the experimental results indicate that low centralized networks can tolerate high intentional attacks and has a better adaptability to attacks than high centralized networks.
引用
收藏
页数:11
相关论文
共 44 条
  • [1] Error and attack tolerance of complex networks
    Albert, R
    Jeong, H
    Barabási, AL
    [J]. NATURE, 2000, 406 (6794) : 378 - 382
  • [2] Identifying topical influencers on twitter based on user behavior and network topology
    Alp, Zeynep Zengin
    Oguducu, Sule Gunduz
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 141 : 211 - 221
  • [3] Barefoot C., 1987, J Comb Math Comb Comput, V1, P12
  • [4] Link and Node Removal in Real Social Networks: A Review
    Bellingeri, Michele
    Bevacqua, Daniele
    Scotognella, Francesco
    Alfieri, Roberto
    Nguyen, Quang
    Montepietra, Daniele
    Cassi, Davide
    [J]. FRONTIERS IN PHYSICS, 2020, 8
  • [5] Complex networks: Structure and dynamics
    Boccaletti, S.
    Latora, V.
    Moreno, Y.
    Chavez, M.
    Hwang, D. -U.
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5): : 175 - 308
  • [6] The anatomy of a large-scale hypertextual Web search engine
    Brin, S
    Page, L
    [J]. COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7): : 107 - 117
  • [7] Catastrophic cascade of failures in interdependent networks
    Buldyrev, Sergey V.
    Parshani, Roni
    Paul, Gerald
    Stanley, H. Eugene
    Havlin, Shlomo
    [J]. NATURE, 2010, 464 (7291) : 1025 - 1028
  • [8] Network robustness and fragility: Percolation on random graphs
    Callaway, DS
    Newman, MEJ
    Strogatz, SH
    Watts, DJ
    [J]. PHYSICAL REVIEW LETTERS, 2000, 85 (25) : 5468 - 5471
  • [9] Vulnerability analysis for large-scale and congested road networks with demand uncertainty
    Chen, Bi Yu
    Lam, William H. K.
    Sumalee, Agachai
    Li, Qingquan
    Li, Zhi-Chun
    [J]. TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2012, 46 (03) : 501 - 516
  • [10] Identifying influential nodes in complex networks
    Chen, Duanbing
    Lu, Linyuan
    Shang, Ming-Sheng
    Zhang, Yi-Cheng
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) : 1777 - 1787