Improvement of the robustness on geographical networks by adding shortcuts
arXiv:physics/0612065 · doi:10.1016/j.physa.2007.02.080
Abstract
In a topological structure affected by geographical constraints on liking, the connectivity is weakened by constructing local stubs with small cycles, a something of randomness to bridge them is crucial for the robust network design. In this paper, we numerically investigate the effects of adding shortcuts on the robustness in geographical scale-free network models under a similar degree distribution to the original one. We show that a small fraction of shortcuts is highly contribute to improve the tolerance of connectivity especially for the intentional attacks on hubs. The improvement is equivalent to the effect by fully rewirings without geographical constraints on linking. Even in the realistic Internet topologies, these effects are virtually examined.
14 pages, 10 figures, 1 table
References in corpus (15)
- Error and attack tolerance of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Classes of behavior of small-world networks
- Resilience of the Internet to random breakdowns
- Breakdown of the Internet under intentional attack
- Epidemics and percolation in small-world networks
- Modeling the Internet's Large-Scale Topology
- The spatial structure of networks
- Pattern Detection in Complex Networks: Correlation Profile of the Internet
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Exact solution of site and bond percolation on small-world networks
- Self-similar disk packings as model spatial scale-free networks
- Geography in a Scale-Free Network Model
- Geographical Embedding of Scale-Free Networks
- Enhancing Robustness and Immunization in geographical networks
Cited by in corpus (6)
- Long-Range Connections in Transportation Networks
- Evolutionary Construction of Geographical Networks with Nearly Optimal Robustness and Efficient Routing Properties
- Growing Self-organized Design of Efficient and Robust Complex Networks
- Spatially self-organized resilient networks by a distributed cooperative mechanism
- Vulnerable Connectivity Caused by Local Communities in Spatial Networks
- Self-organized network design by link survivals and shortcuts