A Notion of Robustness in Complex Networks

We consider a graph-theoretic property known as -robustness which plays a key role in a class of consensus (or opinion) dynamics where each node ignores its most extreme neighbors when updating its state. Previous work has shown that if the graph is -robust for sufficiently large , then such dynamics will lead to consensus even when some nodes behave in an adversarial manner. The property of -robustness also guarantees that the network will remain connected even if a certain number of nodes are removed from the neighborhood of every node in the network and thus it is a stronger indicator of structural robustness than the traditional metric of graph connectivity. In this paper, we study this notion of robustness in common random graph models for complex networks; we show that the properties of robustness and connectivity share the same threshold function in Erdös-Rényi graphs, and have the same values in 1-D geometric graphs and certain preferential attachment networks. This provides new insights into the structure of such networks, and shows that they will be conducive to the types of dynamics described before. Although the aforementioned random graphs are inherently robust, we also show that it is coNP-complete to determine whether any given graph is robust to a specified extent.