arXivDaily arXiv每日学术速递 周一至周五更新
arXiv physics/0702202physics.soc-ph
收藏

一种新的研究网络真实感导航的方法

A novel approach to study realistic navigations on networks

Parongama Sen

摘要:

我们认为导航或搜索方案的网络是现实的意义上说,不是所有的搜索链可以完成。我们表明,数量$μ= ρ/s_d$,其中$s_d$是平均动态最短距离和$ρ$搜索完成的成功率,是一个一致的衡量质量的搜索策略。以无标度网络上的实际搜索为例,我们发现$μ$随系统规模$N$的缩放为$N^{-δ}$,其中$δ$随着搜索策略的改进而减小。这种措施也被证明是敏感的distintinguishing网络的特性。在这种新方法中,动态小世界(DSW)效应被认为是存在时,$δ\approx 0$。我们表明,这样的DSW确实存在于社交网络,其中的链接概率是依赖于社会距离。

英文摘要:

We consider navigation or search schemes on networks which are realistic in the sense that not all search chains can be completed. We show that the quantity $μ= ρ/s_d$, where $s_d$ is the average dynamic shortest distance and $ρ$ the success rate of completion of a search, is a consistent measure for the quality of a search strategy. Taking the example of realistic searches on scale-free networks, we find that $μ$ scales with the system size $N$ as $N^{-δ}$, where $δ$ decreases as the searching strategy is improved. This measure is also shown to be sensitive to the distintinguishing characteristics of networks. In this new approach, a dynamic small world (DSW) effect is said to exist when $δ\approx 0$. We show that such a DSW indeed exists in social networks in which the linking probability is dependent on social distances.

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

↑