Abstract

The robustness of a complex network measures its ability to withstand random or targeted attacks. Most network robustness measures operate under the assumption that the nodes in a network are homogeneous and abstract. However, most real-world networks consist of nodes that are heterogeneous in nature. In this work, we propose a robustness measure called fitness-incorporated average network efficiency, that attempts to capture the heterogeneity of nodes using the ‘fitness’ of nodes in measuring the robustness of a network. Further, we adopt the same measure to compare the robustness of networks with heterogeneous nodes under varying topologies, such as the scale-free topology or the Erdős–Rényi random topology. We apply the proposed robustness measure using a wireless sensor network simulator to show that it can be effectively used to measure the robustness of a network using a topological approach. We also apply the proposed robustness measure to two real-world networks; namely the CO2 exchange network and an air traffic network. We conclude that with the proposed measure, not only the topological structure, but also the fitness function and the fitness distribution among nodes, should be considered in evaluating the robustness of a complex network.

Highlights

  • Most real-world networks exhibit self-organizing and emergent behavior

  • Effect of Network Topology and Node Fitness on Robustness Analysis In Table 1, we present the results of the ranking of nodes in the scale-free network considered, under both homogeneous and heterogeneous node configurations, with more prominent nodes considered as being the ones that are more influential to the network robustness

  • We proposed a node fitness-based approach to capture the node heterogeneity in proposing a novel robustness measure

Read more

Summary

Introduction

Most real-world networks exhibit self-organizing and emergent behavior. They possess non-trivial complex topological features [1,2,3]. Network science attempts to model the structure and function of complex networks. The study of the structure and function of complex networks has gained momentum in the recent past due to its wide applicability in numerous fields such as biology, social sciences and supply chains [3,19,20,21]. The topological structure of complex networks is one of the most important and widely studied characteristics of networks. The two most widely studies topologies are scale-free networks and Erdős–Rényi random networks [6,8]. The fraction P(k) of nodes in the network having k connections to other nodes, in such a manner where

Methods
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call