Article number 8
Published in RGT on November 24, 2020

Innovative metrics for assessing the catastrophic collapse of the complex networks under the greedy attacks on their most important vertices and edges

Keywords:
attack on graph, graph robustness, catastrophic collapse of graph, greedy attack, metric of graph damage

Abstract:

This article proposes the family of the improved metrics for quantifying the damage of the complex networks under the attacks on their vertices and edges. The primary advantage of the proposed metrics compared to the existing ones lies in their ability to describe more thoroughly the distribution of the vertices by the connected components in the damaged network. Another important advance consists in introducing the metrics of the normalized diameter, radius, and average path length describing the structure of the largest connected component in the damaged network with respect to the reference model of the path graph. Finally, the article illustrates the application of the developed metrics for assessing the robustness of the complex networks by performing the experimental analysis of the citation network extracted from the IEEE Xplore database.

References:

1. R. Setola and S. De Porcellinis, "Complex networks and critical infrastructures" in Modelling Estimation and Control of Networked Complex Systems, Berlin Heidelberg:Springer, pp. 91-106, 2009.

View in Google Scholar

2. R. Albert, H. Jeong and A.-L. Barabasi, "Error and attack tolerance of complex networks", Nature, vol. 406, pp. 378-482, 2000.

View in Google Scholar

3. A. Potebnia, "Innovative concept of the strict line hypergraph as the basis for specifying the duality relation between the vertex separators and cuts", Advances in Intelligent Systems and Computing II. CSIT 2017. Advances in Intelligent Systems and Computing, vol. 689, pp. 386-403, 2018.

View in Google Scholar

4. A. Potebnia, "Formation of the multifractal hypergraph structure reflecting the self-similarity properties of the computational complexity classes", IEEE First Ukraine Conference on Electrical and Computer Engineering (UKRCON), pp. 953-958, 2017.

View in Google Scholar

5. S. Iyer, T. Killingback, B. Sundaram and Z. Wang, "Attack robustness and centrality of complex networks", PLoS ONE, vol. 8, no. 4, 2013.

View in Google Scholar

6. P. Isenberg et al., Visualization Publication Dataset, [online] Available: http://www.vispubdata.org/.

View in Google Scholar

Full Text:

2020

Abstract viewed:
21

PDF downloaded:
6
How to Cite:
IEEE Citation Style
▾
  • IEEE Citation Style
  • ACM Citation Style
  • APA Citation Style
  • Harvard Citation Style
  • MLA Citation Style
  • Turabian Citation Style
  • Chicago Citation Style
A. Potebnia, “Innovative metrics for assessing the catastrophic collapse of the complex networks under the greedy attacks on their most important vertices and edges,” 14th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering, pp. 564 – 569, 2018. DOI: 10.​1109/​TCSET.​2018.​​8336265. Open-access version available at https://purl.org/artempotebnia/8
Section:
Original Scientific Articles in Graph Theory
Universal Resource Name:
https:/
/
purl.
org/
artempotebnia/
8
Reading Tools:
Innovative metrics for assessing the catastrophic collapse of the complex networks under the greedy attacks on their most important vertices and edges

Authored by: Artem Potebnia
ORCID: https://orcid.org/0000-0002-8162-5613

Keywords: attack on graph, graph robustness, catastrophic collapse of graph, greedy attack, metric of graph damage

Abstract: This article proposes the family of the improved metrics for quantifying the damage of the complex networks under the attacks on their vertices and edges. The primary advantage of the proposed metrics compared to the existing ones lies in their ability to describe more thoroughly the distribution of the vertices by the connected components in the damaged network. Another important advance consists in introducing the metrics of the normalized diameter, radius, and average path length describing the structure of the largest connected component in the damaged network with respect to the reference model of the path graph. Finally, the article illustrates the application of the developed metrics for assessing the robustness of the complex networks by performing the experimental analysis of the citation network extracted from the IEEE Xplore database.