A Geometric Approach to Robustness in Complex Networks
Unlike traditional studies on network robustness, that typically treat networks as combinatoric objects and rely primarily on classical graph-theoretic concepts (e.g. minimum cuts) to characterize network robustness, the authors explore a geometric approach which enables one to employ more advanced theories and techniques, quantify and compare robustness of networks in terms of their local and global structures. Robustness of nodes to failures in complex networks is dependent on their overall connectedness in the network. Several centralities, that characterize connectedness of nodes in complex networks in varying ways, have been proposed in literature.