arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.11161cs.SIstat.AP
收藏

图的度异质性促进随机Walker会议

Graph Degree Heterogeneity Facilitates Random Walker Meetings

Yusuke Sakumoto, Hiroyuki Ohsaki

摘要:

各种各样的图算法已经开发出多个随机游走,几个独立的随机游走在一个图上的运动。设计基于多重随机游动的高效图算法需要对多重随机游动进行理论研究,以深入了解其特性。首次相遇时间是多重随机游动的重要度量之一。图上的第一次相遇时间由多个随机游走者在图中的同一节点相遇所花费的时间定义。这一次与会合问题密切相关,会合问题是计算机科学中的一个基本问题。多重随机游动的第一次相遇时间以前已经被分析过,但是这些分析中的许多都集中在正则图上。本文分析了任意图中多重随机游动的首次相遇时间,阐明了图的结构对期望值的影响。首先,基于谱图理论推导出了期望首次相遇时间的谱公式。然后,我们检查的主成分的预期首次见面时间使用导出的频谱公式。澄清的主成分揭示了(a)期望的第一次会议时间几乎是由$n/(1+d_{\rm std}^2/d_{\rm avg}^2)$主导的和(b)期望的第一次会议时间是独立的随机游走者的起始节点,其中$n$是图的节点数。$d_{\rm avg}$和$d_{\rm std}$分别是加权节点度的平均值和标准差。特征(a)对于理解图结构对第一次相遇时间的影响是有用的。根据图结构的显示效果,加权度的系数$d_{\rm std}/d_{\rm avg}$(度异质性)的方差有利于随机游走者的相遇。

英文摘要:

Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple random walks theoretically to attain a deep understanding of their characteristics. The first meeting time is one of the important metrics for multiple random walks. The first meeting time on a graph is defined by the time it takes for multiple random walkers to meet at the same node in a graph. This time is closely related to the rendezvous problem, a fundamental problem in computer science. The first meeting time of multiple random walks has been analyzed previously, but many of these analyses have focused on regular graphs. In this paper, we analyze the first meeting time of multiple random walks in arbitrary graphs and clarify the effects of graph structures on expected values. First, we derive the spectral formula of the expected first meeting time on the basis of spectral graph theory. Then, we examine the principal component of the expected first meeting time using the derived spectral formula. The clarified principal component reveals that (a)the expected first meeting time is almost dominated by $n/(1+d_{\rm std}^2/d_{\rm avg}^2)$ and (b)the expected first meeting time is independent of the starting nodes of random walkers, where $n$ is the number of nodes of the graph. $d_{\rm avg}$ and $d_{\rm std}$ are the average and the standard deviation of weighted node degrees, respectively. The characteristic(a) is useful for understanding the effect of the graph structure on the first meeting time. According to the revealed effect of graph structures, the variance of the coefficient $d_{\rm std}/d_{\rm avg}$(degree heterogeneity) for weighted degrees facilitates the meeting of random walkers.

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

↑