Search for node failure in cascading networks

Authors

  • Mark Leo Bejemino National Institute of Physics, University of the Philippines Diliman
  • May Lim National Institute of Physics, University of the Philippines Diliman

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.

Downloads

Issue

Article ID

SPP-2008-2C-03

Section

Complex Systems

Published

2008-10-22

How to Cite

[1]
ML Bejemino and M Lim, Search for node failure in cascading networks, Proceedings of the Samahang Pisika ng Pilipinas 26, SPP-2008-2C-03 (2008). URL: https://proceedings.spp-online.org/article/view/SPP-2008-2C-03.