版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Center for Polymer Studies Boston University Boston Massachusetts 02215 USA Departamento de Física Universidade Federal do Ceará 60451-970 Fortaleza Ceará Brazil Department of Physics Bar-Ilan University 52900 Ramal-Gab Israel
出 版 物:《Physical Review E》 (物理学评论E辑:统计、非线性和软体物理学)
年 卷 期:2013年第87卷第4期
页 面:042810-042810页
核心收录:
学科分类:07[理学] 070203[理学-原子与分子物理] 0702[理学-物理学]
基 金:National Science Foundation, NSF, (1125290) National Science Foundation, NSF Seventh Framework Programme, FP7, (317672) Seventh Framework Programme, FP7
主 题:OPTIMAL control theory EXPONENTIAL functions COMPUTER algorithms PROBLEM solving LATTICE theory
摘 要:The imposition of a cost constraint for constructing the optimal navigation structure surely represents a crucial ingredient in the design and development of any realistic navigation network. Previous works have focused on optimal transport in small-world networks built from two-dimensional lattices by adding long-range connections with Manhattan length rij taken from the distribution Pij∼rij−α, where α is a variable exponent. It has been shown that, by introducing a cost constraint on the total length of the additional links, regardless of the strategy used by the traveler (independent of whether it is based on local or global knowledge of the network structure), the best transportation condition is obtained with an exponent α=d+1, where d is the dimension of the underlying lattice. Here we present further support, through a high-performance real-time algorithm, on the validity of this conjecture in three-dimensional regular as well as in two-dimensional critical percolation clusters. Our results clearly indicate that cost constraint in the navigation problem provides a proper theoretical framework to justify the evolving topologies of real complex network structures, as recently demonstrated for the networks of the US airports and the human brain activity.