Efficiently counting complex multilayer temporal motifs in large-scale networks

In a new paper titled “Efficiently counting complex multilayer temporal motifs in large-scale networks” we detail our approach to counting multilayer temporal motifs in networks with partial timing. The code (see Bitbucket) builds upon the well-known Stanford Network Analysis (SNAP) package.