Degree heterogeneity in spatial networks with total cost constraint

Abstract

Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability $P_{ij}\sim r_{ij}^{-\alpha }$, where $r_{ij}$ is the Manhattan length of the long-range edges. The total length of the additional edges is subject to a cost constraint ($\sum r=C$). These networks have fixed optimal exponent $\alpha$ for transportation (measured by the average shortest-path length). However, we observe that the degree in such spatial networks is homogenously distributed, which is far different from real networks such as airline systems. In this paper, we propose a method to introduce degree heterogeneity in spatial networks with total cost constraint. Results show that with degree heterogeneity the optimal exponent shifts to a smaller value and the average shortest-path length can further decrease. Moreover, we consider the synchronization on the spatial networks and related results are discussed. Our new model may better reproduce the features of many real transportation systems.

4 pages, 4 figures

References in corpus (10)

• Synchronization in complex networks
• Spatial Networks
• Mitigation of Malicious Attacks on Networks
• Understanding the spreading patterns of mobile phone viruses
• How to make a fragile network robust and vice versa
• Onion structure and network robustness
• Geographical networks evolving with optimal policy
• Exact Solution for Optimal Navigation with Total Cost Restriction
• Dynamics on Spatial Networks and the Effect of Distance Coarse Graining
• Heterogeneous network with distance dependent connectivity