Fig. 1From: Temporal network compression via network hashingLeft: a temporal network defined as a series of events ordered in time (\(t_i<t_j\) for \(i<j\)). The out-component of node 3 is circled in blue; the in-component of node 2 is circled in purple. Right: the corresponding component matrix. A row depicts the in-component of a node (we emphasise that of node 2). A column depicts the out-component of a node (we emphasise that of node 3): a non-zero element in the uth column at coordinate v, means that node v belongs to the out-component of node uBack to article page