Iterative Assessment of Edge Criticality: Efficiency Enhancement or Hidden Insufficiency Detection
The assessment of edge criticality ranking in complex networks is a challenging issue in network science and has numerous applications, including network decomposition and, conversely, enhancing the resilience and redundancy of complex systems. Two main approaches are commonly used to rank edges bas...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10949212/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The assessment of edge criticality ranking in complex networks is a challenging issue in network science and has numerous applications, including network decomposition and, conversely, enhancing the resilience and redundancy of complex systems. Two main approaches are commonly used to rank edges based on their importance for maintaining network connectivity. The first is the Static approach, which relies on a single evaluation of topological features. The second is the Optimization-based approach, which treats network decomposition as an integral process and optimizes the edge sequence for network decomposition using genetic-like algorithms. While the Static approach is computationally efficient, the Optimization-based approach potentially yields the best decomposition pattern. In the present work, we propose the Iterative approach, which bridges the gap between these two methods. The Iterative approach involves a loop of identifying the most critical edge using selected ranking algorithms, removing it from the network, and then re-assessing edge criticality based on the modified network topology. As a result, the ranking of edge criticality depends not only on the initial topology of the network but also on its continuous modifications caused by edge removal. To evaluate the efficiency of the Iterative approach, we analyze the decomposition of sixteen well-known real-world benchmark networks using seven widely recognized edge ranking algorithms. The results demonstrate, first, that the Iterative approach can achieve a tenfold increase in the efficiency of network decomposition. Second, the analysis reveals hidden inner insufficiency in edge ranking for some algorithms, as evidenced by the fact that algorithm iterations can reduce decomposition efficiency. Additionally, we discuss the time complexity of the Iterative approach and strategies for its reduction. We also outline a potential framework for combining the Static and Iterative approaches during the network decomposition process to further enhance its efficiency. |
|---|---|
| ISSN: | 2169-3536 |