Low-dimensional representations, or embeddings, of a graph's nodes facilitate
several practical data science and data engineering tasks. As such embeddings
rely, explicitly or implicitly, on a similarity measure among nodes, they
require the computation of a quadratic similarity matrix, inducing a tradeoff
between space complexity and embedding quality. To d