Representing networks in a low dimensional latent space is a crucial task
with many interesting applications in graph learning problems, such as link
prediction and node classification. A widely applied network representation
learning paradigm is based on the combination of random walks for sampling
context nodes and the traditional \textit{Skip-Gram} model