期刊
PHYSICAL REVIEW LETTERS
卷 102, 期 23, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevLett.102.238703
关键词
-
资金
- Swiss National Research Foundation [200020-116286]
Navigability of networks, that is, the ability to find any given destination vertex starting from any other vertex, is crucial to their usefulness. In 2000 Kleinberg showed that optimal navigability could be achieved in small world networks provided that a special recipe was used to establish long range connections, and that a greedy algorithm, that ensures that the destination will be reached, is used. Here we provide an exact solution for the asymptotic behavior of such a greedy algorithm as a function of the system's parameters. Our solution enables us to show that the original claim that only a very special construction is optimal can be relaxed depending on further constraints, such as, for example, cost minimization, that must be satisfied.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据