Fig. 2From: Temporal network compression via network hashingFrom a given temporal network (left graph), we compute the Component Matrix (right matrix) of size \(n \times n\), with \(n=5\), by scanning the series of events. For each event, we compute the OR operation between the rows of the matrix corresponding to the interacting nodes and replace them by the result. Matrix \(\mathbf {S_4}\) is the component matrix at the end of the streaming after \(m=4\) eventsBack to article page