arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.0040cond-mat.dis-nncs.SIphysics.soc-ph
收藏

小世界网络中的增强流

Enhanced Flow in Small-World Networks

Cláudio L. N. Oliveira, Pablo A. Morais, André A. Moreira, José S. Andrade

摘要:

众所周知,小世界特性对复杂网络的导航效率有着深远的影响[J. M。Kleinberg,Nature 406,845(2000)]。因此,向规则衬底适当地添加快捷方式可以导致形成用于信息传播的高效结构。在这里,我们表明,在这些复杂的拓扑结构中也可以观察到增强的流动特性。准确地说,我们的模型是一个从底层规则格构建的网络,在该格上,远程连接根据概率$P_{ij}\sim r_{ij}^{-α}$随机添加,其中$r_{ij}$是节点$i$和$j$之间的曼哈顿距离,指数$α$是一个控制参数。通过考虑每个链路具有由$g_{ij}\propto r_{ij}^{-δ}$给出的局部电导来计算系统的平均两点全局电导,其中$δ$确定远程连接的地理限制(成本)的程度。我们的研究结果表明,$δ=0$与$α=0$获得最佳的流动条件,而对于$δ\gg 1$的总电导总是增加与$α$。对于$δ\approx 1$,$α=d$成为最佳指数,其中$d$是衬底的拓扑尺寸。有趣的是,这个指数与使用分散算法在小世界网络中获得的最佳导航指数相同。

英文摘要:

The small-world property is known to have a profound effect on the navigation efficiency of complex networks [J. M. Kleinberg, Nature 406, 845 (2000)]. Accordingly, the proper addition of shortcuts to a regular substrate can lead to the formation of a highly efficient structure for information propagation. Here we show that enhanced flow properties can also be observed in these complex topologies. Precisely, our model is a network built from an underlying regular lattice over which long-range connections are randomly added according to the probability, $P_{ij}\sim r_{ij}^{-α}$, where $r_{ij}$ is the Manhattan distance between nodes $i$ and $j$, and the exponent $α$ is a controlling parameter. The mean two-point global conductance of the system is computed by considering that each link has a local conductance given by $g_{ij}\propto r_{ij}^{-δ}$, where $δ$ determines the extent of the geographical limitations (costs) on the long-range connections. Our results show that the best flow conditions are obtained for $δ=0$ with $α=0$, while for $δ\gg 1$ the overall conductance always increases with $α$. For $δ\approx 1$, $α=d$ becomes the optimal exponent, where $d$ is the topological dimension of the substrate. Interestingly, this exponent is identical to the one obtained for optimal navigation in small-world networks using decentralized algorithms.

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

↑