arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1007.1809cond-mat.dis-nn
收藏

复杂网络上随机游动寻路的平均首中时间

Mean First Hitting Time of Searching for Path Through Random Walks on Complex Networks

Shao-Ping Wang, Wen-Jiang Pei

摘要:

研究了通过随机游动在网络上寻找固定路径$ε_0ε_1\cdotsε_l$的问题。分析了跟踪路径的首中时间,得到了平均首中时间$\langle T \rangle$的精确表达式。令人惊讶的是,我们发现$\langle T \rangle$分为两个不同的部分:$T_1$和$T_2$。第一部分$T_1 =2m\prod_{i=1}^{l-1}d(ε_i)$与路径本身有关,与度积成正比。第二部分是$T_2$的网络结构。在此基础上,我们提出了一种自然的路径测度,即$φ=\prod_{i=1}^{l-1}d(ε_i)$,并称之为随机行走路径测度(RWPM)。$φ$基本上决定了路径在搜索和传输过程中的性能。通过最小化$φ$,我们还找到了RW最优路由,这是一个组合的随机行走和最短路径路由。RW最优路由可以有效地平衡整个网络中节点和边的流量负载,并且优于任何类型的复杂网络中的最短路径路由。数值模拟证实了我们的分析。

英文摘要:

We study the problem of searching for a fixed path $ε_0ε_1\cdotsε_l$ on a network through random walks. We analyze the first hitting time of tracking the path, and obtain exact expression of mean first hitting time $\langle T \rangle$. Surprisingly we find that $\langle T \rangle$ is divided into two distinct parts: $T_1$ and $T_2$. The first part $T_1 =2m\prod_{i=1}^{l-1}d(ε_i)$, is related with the path itself and is proportional to the degree product. The second part $T_2$ is related with the network structure. Based on the analytic results, we propose a natural measure for each path, i.e. $φ=\prod_{i=1}^{l-1}d(ε_i)$, and call it random walk path measure(RWPM). $φ$ essentially determines a path's performance in searching and transporting processes. By minimizing $φ$, we also find RW optimal routing which is a combination of random walk and shortest path routing. RW optimal routing can effectively balance traffic load on nodes and edges across the whole network, and is superior to shortest path routing on any type of complex networks. Numerical simulations confirm our analysis.

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

↑