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.
Downloads
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.
