arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.04904physics.soc-phcs.SI
收藏

网络上node2vec随机游动的分析

Analysis of node2vec random walks on networks

Lingqi Meng, Naoki Masuda

摘要:

随机游走已被证明是有用的构造各种算法,以获得网络上的信息。算法node2vec使用有偏随机游走来实现节点到低维空间的嵌入,然后可以用于多标签分类和链接预测等任务。node2vec算法在这些应用中的性能被认为取决于该算法使用的随机游走的属性。在本研究中,我们从理论上和数值分析的node2vec使用的随机游动。这些随机游走是二阶马尔可夫链。我们利用其转移规则到有向边之间的转移概率矩阵的映射来分析平稳概率、转移概率矩阵谱间隙的弛豫时间和合并时间。特别是,我们表明,node2vec随机游走加速扩散时,步行者的设计,以避免回溯和访问以前访问过的节点的邻居,但不完全避免他们。

英文摘要:

Random walks have been proven to be useful for constructing various algorithms to gain information on networks. Algorithm node2vec employs biased random walks to realize embeddings of nodes into low-dimensional spaces, which can then be used for tasks such as multi-label classification and link prediction. The performance of the node2vec algorithm in these applications is considered to depend on properties of random walks that the algorithm uses. In the present study, we theoretically and numerically analyze random walks used by the node2vec. Those random walks are second-order Markov chains. We exploit the mapping of its transition rule to a transition probability matrix among directed edges to analyze the stationary probability, relaxation times in terms of the spectral gap of the transition probability matrix, and coalescence time. In particular, we show that node2vec random walk accelerates diffusion when walkers are designed to avoid both back-tracking and visiting a neighbor of the previously visited node but do not avoid them completely.

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

↑