Skip to main content

Table 2 Notations used in the second oder similarity algorithm

From: Node embeddings in dynamic graphs

uv the new directed edge that is being processed in the edge stream
t(xy) time of arrival of a multi-edge instance
π i a permutation of the entire vertex set, fixed in time
N(u,t) the pruned neighbors of u at time t
hi(u)=hi(N(U,t)) the i-th fingerprint of u at time t