arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.0241physics.soc-phcs.SIstat.CO
收藏

总费用约束下空间网络的度异质性

Degree heterogeneity in spatial networks with total cost constraint

Weiping Liu, An Zeng, Yanbo Zhou

摘要:

最近,在[物理学。104,018701(2010)],作者研究了通过以概率$P_{ij}\sim r_{ij}^{-α}$添加长程边(捷径)而从规则晶格构造的空间网络,其中$r_{ij}$是长程边的曼哈顿长度。附加边的总长度受到成本约束($\sum r=C$)的影响。这些网络具有固定的最优传输指数$α$(通过平均最短路径长度测量)。然而,我们观察到这种空间网络中的度是均匀分布的,这与航空公司系统等真实网络有很大不同。本文提出了一种在总代价约束下引入度异质性的空间网络模型。结果表明,随着度的异质性,最优指数向更小的值移动,平均最短路径长度可以进一步减小。此外,我们考虑了空间网络上的同步,并对相关结果进行了讨论。我们的新模型可以更好地再现许多真实交通系统的特征。

英文摘要:

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}^{-α}$, 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 $α$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑