Analysis of node2vec random walks on networks: Node2vec random walks on networks

Lingqi Meng, Naoki Masuda*

*この研究の対応する著者

研究成果: Article査読

抄録

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 analyse 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 analyse 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 backtracking and visiting a neighbour of the previously visited node but do not avoid them completely.

本文言語English
論文番号0447
ジャーナルProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
476
2243
DOI
出版ステータスPublished - 2020
外部発表はい

ASJC Scopus subject areas

  • 数学 (全般)
  • 工学(全般)
  • 物理学および天文学(全般)

フィンガープリント

「Analysis of node2vec random walks on networks: Node2vec random walks on networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル