Skip to main content
Fig. 5 | Applied Network Science

Fig. 5

From: Node embeddings in dynamic graphs

Fig. 5

Whenever a new edge uv appears, a new walk starts from u (red), and each temporal walk (z1,z2,z3) that ended in u up to time tu continues via uv (blue). We get p(v,t(uv)) by summing up the contribution of the previous two type of walks (red and blue) with the decayed weight of walks that have already reached node v (purple) before time t(uv)

Back to article page