Abstract
There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. The resulting proximity-optimal GMs are intuitively robust and hence are adopted as the benchmark. Then, a generalized mesh (GM) is grown up by stepwise optimizing a given measure of network robustness. The following findings are presented: (1) The algebraic connectivity-optimal GMs deviate quickly from the proximity-optimal GMs, yielding a number of less robust GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt. (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This partly justifies the two quantities as metrics of network robustness. (3) The efficiency-optimal GMs deviate gradually from the proximity-optimal GMs, yielding some less robust GMs. This suggests the limited utility of the efficiency as a measure of network robustness.
Highlights
Nowadays, we live in a highly networked world, where numerous critical facilities are connected together by various networks
(2) The effective resistace-optimal generalized meshes (GMs) and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs
This paper addresses the rationality of the four metrics of network robustness by investigating the robust growth of generalized meshes (GMs)
Summary
We live in a highly networked world, where numerous critical facilities are connected together by various networks. To measure the robustness of a network, a number of metrics, such as the connectivity [1], the algebraic connectivity [2,3,4,5,6,7], the effective resistance [8,9,10], the average edge betweenness [9, 10], and the efficiency [10], have been proposed. This paper addresses the rationality of the four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.