Skip to main content
Fig. 7 | Applied Network Science

Fig. 7

From: Node embeddings in dynamic graphs

Fig. 7

Illustration of how the fingerprints of node u change when adding the new edge uv. Neighbors of u are ordered in time as t1<t2<t3<t. Two fixed random permutations π1 and π2 define the fingerprints h1(u) and h2(u). In π1 (red), v has minimum value, hence the previous h1(u) will be reassigned to v. In π2 (purple), the minimum is the oldest node v1, which becomes too old and gets removed from N(u,t). The correct value for h2(u) would be v2 (). Instead we heuristically set h2(u)=v after the removal of v1

Back to article page