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

用于信息搜索的扩散捕获过程

Diffusive capture processes for information search

Sungmin Lee, Soon-Hyung Yook, Yup Kim

摘要:

我们展示了如何有效地扩散捕获过程(DCP)的复杂网络可以应用到网络中的信息搜索。数值模拟表明,我们的方法产生的流量只有2%相比,最流行的基于查询的数据包转发(FB)算法。我们发现,我们的模型的平均搜索时间,$<T>$,是更可扩展的比另一个著名的$n$ -随机步行者模型和FB算法在真实Gnutella网络和无标度网络与$γ=2.4$。我们还讨论了$<T>$和网络度分布的二阶矩$<k^2>$之间的可能关系。

英文摘要:

We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular flooding-based query-packet-forwarding (FB) algorithm. We find that the average searching time, $<T>$, of the our model is more scalable than another well known $n$-random walker model and comparable to the FB algorithm both on real Gnutella network and scale-free networks with $γ=2.4$. We also discuss the possible relationship between $<T>$ and $<k^2>$, the second moment of the degree distribution of the networks.

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

↑