Learning temporal attention in dynamic graphs with bilinear interactions
Fig 2
A recursive update of node embeddingsz and temporal attention S.
An event between nodes u = 1 and v = 3 creates a temporary edge that allows the information to flow (in pink arrows) from neighbors of node u to node v. Orange edges denote updated attention values. Normalization of attention values to sum to one can affect attention of neighbors of node v. Dotted edges denote absent edges (or edges with small values).