Range-based attacks on links in random scale-free networks

Abstract

$Range$ and $load$ play keys on the problem of attacking on links in random scale-free (RSF) networks. In this Brief Report we obtain the relation between $range$ and $load$ in RSF networks analytically by the generating function theory, and then give an estimation about the impact of attacks on the $efficiency$ of the network. The analytical results show that short range attacks are more destructive for RSF networks, and are confirmed numerically. Further our results are consistent with the former literature (Physical Review E \textbf{66}, 065103(R) (2002)).

References in corpus (11)

• Community structure in social and biological networks
• Error and attack tolerance of complex networks
• Lethality and centrality in protein networks
• Efficient Behavior of Small-World Networks
• Random graphs with arbitrary degree distributions and their applications
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Attack vulnerability of complex networks
• Breakdown of the Internet under intentional attack
• Universal Behavior of Load Distribution in Scale-free Networks
• Range-based attack on links in scale-free networks: are long-range links responsible for the small-world phenomenon?