Invulnerability analysis of scale-free network and small-world network
Authors: 
Mengjiao Chen, Daijun WeiAuthors Info & Claims
Pages 113 - 119
Abstract
This paper analyzes the invulnerability of two kinds of networks with different degrees of distribution. According to their topology, four attack strategies and two metrics were selected. The most effective attack strategy and the most appropriate measure index for different networks are obtained, and the special structural characteristics of small-world networks are verified from the perspective of invulnerability. The results shown that: (1) The largest connected subgraph can better distinguish the differences of different attack strategies and is an appropriate metrics. (2) Small-world has the best invulnerability under clustering coefficient first attack. (3) For both networks, the betweenness centrality attack is the most effective attack strategy. (4) The invulnerability of scale-free networks is better than that of small-world networks.
References
[1]
Dimitris Achlioptas, Raissa M D’Souza, and Joel Spencer. 2009. Explosive percolation in random networks. science 323, 5920 (2009), 1453–1455.
[2]
Michele Bellingeri, Davide Cassi, and Simone Vincenzi. 2014. Efficiency of attack strategies on complex model and real-world networks. Physica A: Statistical Mechanics and its Applications 414 (2014), 174–180.
[3]
Giacomo Cappon and Morten Gram Pedersen. 2016. Heterogeneity and nearest-neighbor coupling can explain small-worldness and wave properties in pancreatic islets. Chaos: An Interdisciplinary Journal of Nonlinear Science 26, 5 (2016), 053103.
[4]
Gaolin Chen, Shuming Zhou, Jiafei Liu, Min Li, and Qianru Zhou. 2020. Influential node detection of social networks based on network invulnerability. Physics Letters A 384, 34 (2020), 126879.
[5]
Paolo Crucitti, Vito Latora, Massimo Marchiori, and Andrea Rapisarda. 2003. Efficiency of scale-free networks: error and attack tolerance. Physica A: Statistical Mechanics and its Applications 320 (2003), 622–642.
[6]
Jordi Delgado. 2002. Emergence of social conventions in complex networks. Artificial intelligence 141, 1-2 (2002), 171–185.
[7]
Xiangbo Li, Gangjin Wang, and Daijun Wei. 2022. Dynamical evolution behavior of scientific collaboration hypernetwork. AIP Advances 12, 11 (2022), 115117.
[8]
Haijun Liang, Shiyu Zhang, and Jianguo Kong. 2023. Study on Characteristics and Invulnerability of Airspace Sector Network Using Complex Network Theory. Aerospace 10, 3 (2023), 225.
[9]
Fabio Pasqualetti, Antonio Bicchi, and Francesco Bullo. 2011. A graph-theoretical characterization of power network vulnerabilities. In Proceedings of the 2011 American Control Conference. IEEE, 3918–3923.
[10]
Jörg Stelling, Steffen Klamt, Katja Bettenbrock, Stefan Schuster, and Ernst Dieter Gilles. 2002. Metabolic network structure determines key aspects of functionality and regulation. Nature 420, 6912 (2002), 190–193.
[11]
Dan Wang, Feng Tian, and Daijun Wei. 2022. Correlation analysis of combined layers in multiplex networks based on entropy. Plos one 17, 10 (2022), e0276344.
[12]
Dan Wang, Feng Tian, and Daijun Wei. 2023. A new centrality ranking method for multilayer networks. Journal of Computational Science 66 (2023), 101924.
[13]
Xiao Fan Wang and Guanrong Chen. 2003. Complex networks: small-world, scale-free and beyond. IEEE circuits and systems magazine 3, 1 (2003), 6–20.
[14]
Yu Wang, Di Lei, JiaoJiao Yu, and GuoBing Wen. 2023. A study of cascading invulnerability of three major state-owned airlines’ route networks based on a nonlinear load capacity model. In Sixth International Conference on Traffic Engineering and Transportation System (ICTETS 2022), Vol. 12591. SPIE, 322–327.
[15]
Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of ‘small-world’networks. nature 393, 6684 (1998), 440–442.
[16]
Daijun Wei, Xinyang Deng, Xiaoge Zhang, Yong Deng, and Sankaran Mahadevan. 2013. Identifying influential nodes in weighted networks based on evidence theory. Physica A: Statistical Mechanics and its Applications 392, 10 (2013), 2564–2575.
[17]
Yu Xie, Bin Yu, Shengze Lv, Chen Zhang, Guodong Wang, and Maoguo Gong. 2021. A survey on heterogeneous network representation learning. Pattern recognition 116 (2021), 107936.
[18]
Yu Zeng. 2020. Evaluation of node importance and invulnerability simulation analysis in complex load-network. Neurocomputing 416 (2020), 158–164.
[19]
Jianhua Zhang, Funian Hu, Shuliang Wang, Yang Dai, and Yixing Wang. 2016. Structural vulnerability and intervention of high speed railway networks. Physica A: Statistical Mechanics and its Applications 462 (2016), 743–751.
[20]
Yifan Zhang and S Thomas Ng. 2022. Robustness of urban railway networks against the cascading failures induced by the fluctuation of passenger flow. Reliability Engineering & System Safety 219 (2022), 108227.
Index Terms
- Invulnerability analysis of scale-free network and small-world network
Recommendations
Small-world phenomenon of keywords network based on complex network
Based on the network comprised of 111,444 keywords of library and information science that are extracted from Scopus, and taken into consideration the major properties of average distance and clustering coefficients, the present authors, with the ...
Small-World Network in OMNeT++
ISMS '12: Proceedings of the 2012 Third International Conference on Intelligent Systems Modelling and SimulationThe small-world phenomenon describes the behavior of very large networks with a relatively small number of hops between any two nodes. The main characteristics of such networks are small average path length (L) and large clustering coefficient (C). In ...
A Scale-Free Small-World Network from Durer Pentagons
IWCFTA '11: Proceedings of the 2011 Fourth International Workshop on Chaos-Fractals Theories and ApplicationsThe complex network is a focus among the research on the complex systems today. In this paper, we propose a deterministic network called Durer networks arising from the Durer pentagons. It is revealed that the tail of the degree distribution follows a ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2023
199 pages
ISBN:9798400707605
DOI:10.1145/3611450
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 August 2023
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
AI2A '23
AI2A '23: 2023 3rd International Conference on Artificial Intelligence, Automation and Algorithms
July 21 - 23, 2023
Beijing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 43Total Downloads
- Downloads (Last 12 months)33
- Downloads (Last 6 weeks)2
Reflects downloads up to 14 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format