Scalable Motif Counting for Large-scale Temporal Graphs

TL;DR

This paper introduces a scalable parallel framework for exactly counting temporal motifs in large-scale temporal graphs, significantly improving efficiency and speedup over existing methods through customized algorithms and hierarchical parallelism.

Contribution

It presents a novel hierarchical parallel framework with customized algorithms and data structures for efficient exact temporal motif counting on large graphs.

Findings

Achieves up to 538x speedup compared to state-of-the-art methods.

Effectively leverages multi-threading for concurrent motif counting.

Demonstrates scalability and efficiency on sixteen real-world datasets.

Abstract

One fundamental problem in temporal graph analysis is to count the occurrences of small connected subgraph patterns (i.e., motifs), which benefits a broad range of real-world applications, such as anomaly detection, structure prediction, and network representation learning. However, existing works focused on exacting temporal motif are not scalable to large-scale temporal graph data, due to their heavy computational costs or inherent inadequacy of parallelism. In this work, we propose a scalable parallel framework for exactly counting temporal motifs in large-scale temporal graphs. We first categorize the temporal motifs based on their distinct properties, and then design customized algorithms that offer efficient strategies to exactly count the motif instances of each category. Moreover, our compact data structures, namely triple and quadruple counters, enable our algorithms to directly identify the temporal motif instances of each category, according to edge information and the relationship between edges, therefore significantly improving the counting efficiency. Based on the proposed counting algorithms, we design a hierarchical parallel framework that features both inter- and intra-node parallel strategies, and fully leverages the multi-threading capacity of modern CPU to concurrently count all temporal motifs. Extensive experiments on sixteen real-world temporal graph datasets demonstrate the superiority and capability of our proposed framework for temporal motif counting, achieving up to 538* speedup compared to the state-of-the-art methods. The source code of our method is available at: https://github.com/steven-ccq/FAST-temporal-motif.