کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
975279 | 1645118 | 2014 | 7 صفحه PDF | دانلود رایگان |
• We investigated the efficiency of network attack strategies.
• We used the size of the largest connected component as a damage measure.
• We tested 3 attack strategies introduced in this work for the first time.
• Deletion according to betweenness centrality was the most efficient attack strategy.
We investigated the efficiency of attack strategies to network nodes when targeting several complex model and real-world networks. We tested 5 attack strategies, 3 of which were introduced in this work for the first time, to attack 3 model networks (Erdos and Renyi, Barabasi and Albert preferential attachment network, and scale-free network configuration models) and 3 real networks (Gnutella peer-to-peer network, email network of the University of Rovira i Virgili, and immunoglobulin interaction network). Nodes were removed sequentially according to the importance criterion defined by the attack strategy, and we used the size of the largest connected component (LCC) as a measure of network damage. We found that the efficiency of attack strategies (fraction of nodes to be deleted for a given reduction of LCC size) depends on the topology of the network, although attacks based on either the number of connections of a node or betweenness centrality were often the most efficient strategies. Sequential deletion of nodes in decreasing order of betweenness centrality was the most efficient attack strategy when targeting real-world networks. The relative efficiency of attack strategies often changed during the sequential removal of nodes, especially for networks with power-law degree distribution.
Journal: Physica A: Statistical Mechanics and its Applications - Volume 414, 15 November 2014, Pages 174–180