In this paper, we introduce InstantEmbedding, an efficient method for generating single-node representations using local PageRank computations. We theoretically prove that our approach produces globally consistent representations in sublinear time. We demonstrate this empirically by conducting extensive experiments on real-world datasets with over a billion edges. Our experiments confirm that InstantEmbedding requires drastically less computation time (over 9,000 times faster) and less memory (by over 8,000 times) to produce a single node's embedding than traditional methods including DeepWalk, node2vec, VERSE, and FastRP. We also show that our method produces high quality representations, demonstrating results that meet or exceed the state of the art for unsupervised representation learning on tasks like node classification and link prediction.
@article{arxiv.2010.06992,
title = {InstantEmbedding: Efficient Local Node Representations},
author = {Ştefan Postăvaru and Anton Tsitsulin and Filipe Miguel Gonçalves de Almeida and Yingtao Tian and Silvio Lattanzi and Bryan Perozzi},
journal= {arXiv preprint arXiv:2010.06992},
year = {2020}
}