Skip to main content

Table 1 Notations used in the StreamWalk algorithm

From: Node embeddings in dynamic graphs

z

a temporal walk

uv

the new directed edge that is being processed in the edge stream

t(xy)

time of arrival of a multi-edge instance

t u

last time an edge arrived leading to u

β

decay exponent for the length of the walk

γ

time-aware edge weighting function

p(z,t)

weight of walk z at time t

p(w,t)

sum of weight of walks ending in node w at time t

p(xy)

sum of weight of walks ending with edge xy at time t(xy)