A New Metric to Evaluate Network Robustness

Abstract

Robustness is one of the most important properties of network, because it represents the network tolerance against failures. Thus, this property is considered in many real-world networks, such as distribution networks and communication networks. In order to evaluate this property, many measurements have been proposed, most of which are based on the size of giant component. In this paper, we introduced a concept of coloring nodes, by which we can classify nodes into two groups, and based on this concept, we proposed a new metric to measure the network robustness. Then, we implemented our proposed metric on random network and scale-free network to compare their behaviors. Finally, we compare the efficiency of our proposed method with another state-of-the-are robustness metric.