Search for node failure in cascading networks

Abstract

We consider the problem of searching for a node that has failed (FN) thus promoting a cascading breakdown in complex networks. Using a simple algorithm, we show that the FN in a Preferential Detachment network could be determined with a 99% success rate (SR). For Barabasi-Albert network, Erdos- Renyi network, and Watts-Strogatz networks, SR as high as 100% is attainable. We also show that higher mean degree increases the efficiency of the algorithm.