Algorithm Details

Neural Information Processing Systems 

A.1 The Derivation of Approximate Von Neumann Entropy on Temporal Network In the following, We commence by summarizing the approximation of the undirected graph von Neumann entropy presented by [27]. The best results in each column are highlighted in bold font and the second-best results are underlined. As a result, The expression of the approximate entropy is quadratic in the number of nodes. B.1 Performances in Average Precision Table 3 reports the detailed transductive and inductive link prediction results of AP. B.2 Time Comparison Figure 1 compares the training times of ESSEN against the second-strongest baseline NTW.