arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.4980cond-mat.stat-mechmath-phmath.MP
收藏

基于广义随机游动的网络发现

Network Discovery by Generalized Random Walks

A. Asztalos, Z. Toroczkai

摘要:

我们通过在大型图上定义的平稳和自适应转移概率来研究网络探索。我们推导出一个精确的公式,适用于任意图形和任意步行与固定的转移概率(STP),发现的边缘作为时间的函数的平均数。我们发现,STP步行网站和边缘探索服从相同的缩放$\sim n^λ$作为时间的函数$n$。因此,与站点探索相比,具有许多循环的图上的边缘探索总是滞后的,所揭示的图是稀疏的,直到几乎所有节点都被发现为止。然后,我们介绍了边缘资源管理器模型,它提出了一种新的自适应行走,即使在密集的网络上也能执行忠实的网络发现。

英文摘要:

We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition probabilities (STP), for the average number of discovered edges as function of time. We show that for STP walks site and edge exploration obey the same scaling $\sim n^λ$ as function of time $n$. Therefore, edge exploration on graphs with many loops is always lagging compared to site exploration, the revealed graph being sparse until almost all nodes have been discovered. We then introduce the Edge Explorer Model, which presents a novel class of adaptive walks, that perform faithful network discovery even on dense networks.

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

↑