Embedding the nodes of a large network into an Euclidean space is a common objective in modern machine learning, with a variety of tools available. These embeddings can then be used as features for tasks such as community detection/node clustering or link prediction, where they achieve state of the art performance. With the exception of spectral clustering methods, there is little theoretical understanding for other commonly used approaches to learning embeddings. In this work we examine the theoretical properties of the embeddings learned by node2vec. Our main result shows that the use of k-means clustering on the embedding vectors produced by node2vec gives weakly consistent community recovery for the nodes in (degree corrected) stochastic block models. We also discuss the use of these embeddings for node and link prediction tasks. We demonstrate this result empirically, and examine how this relates to other embedding tools for network data.

通过对大型网络的节点进行嵌入，得到欧几里德空间中的表示是现代机器学习中的一个常见目标，该研究工作就对 node2vec 学习到的嵌入进行了理论性的分析，证明了其在聚类任务中表现出较弱的一致性，并对其在网络数据中的应用进行了讨论。

使用Node2Vec学习得到的嵌入进行社区检测和分类保证