Check it out!
Paper: lnkd.in/dkNs8_F2
Code's documentation: lnkd.in/dWkiGfsX
Paper on temporal graph distance: www.nature.com/articles/s41...

Building on our result, we design a task-agnostic embedding algorithm in the 2Vec spirit which can be easily adapted to arbitrary embedding problems. This algorithm is also performing the heavy lifting for our definition of distance between temporal graphs.

In this paper, we propose an efficient linear-time approximation of SoftMax normalization constants, a well-known and hard problem in machine learning.