Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7374852 | Physica A: Statistical Mechanics and its Applications | 2018 | 31 Pages |
Abstract
We find that the weighted node attack strategy Str (i.e. strength attack), which removes nodes according to their strength, is the most efficient to blemish the system when evaluating the damage with a weighted efficiency. Differently, betweenness attack strategy Bet, which removes nodes according to their centrality is the most efficient when using the binary efficiency to compute the network damage. These results indicate that adopting weighted or binary efficiency to measure networks functioning changed the efficacy of the attack strategies to damage the system. Last, we found a non-negligible fraction of random removals to be more efficient than the attack strategies; given that the main goal of the attack strategies is to individuate important nodes in the system, i.e. nodes which removal triggers highest damage, our results would indicate how in order to find the most important nodes may be more efficient to simulate an higher number of random nodes removal.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
M. Bellingeri, D. Bevacqua, F. Scotognella, Zhe-Ming LU, D. Cassi,