In applications one could replace path-based measures with dot product between path2vec embeddings, gaining significant speedup in distance computation between nodes.
our model could be used to speed up various other graph-based algorithms that make use of node distance computations, such as Floyd (1962) algorithm, Dijkstra (1959) algorithm, or algorithms for computing node betweenness centrality (Brandes, 2001).