Motif Counting in Complex Networks: A Comprehensive Survey
Haozhe Yin, Kai Wang, Wenjie Zhang, Yizhang He, Ying Zhang, Xuemin Lin
TL;DR
The survey addresses motif counting in increasingly complex networks by organizing methods across general graphs, heterogeneous graphs, and hypergraphs, and by contrasting exact, approximate, and parallel approaches. It catalogs motif families such as triangles, cliques, butterflies, bitriangles, and hypergraph motifs, detailing algorithmic families (in-memory, heterogeneous, parallel) and notable systems (MapReduce, GPUs, MPI) along with sampling-based estimators. It highlights emerging directions, including GraphRAG and motif-aware integration with large language models, as well as scalable techniques for dynamic, large-scale networks. The work provides a practical synthesis to guide researchers and practitioners in selecting motif models and algorithms for diverse, real-world graph data, and points to opportunities where higher-order motifs can drive interpretability and performance in complex systems.
Abstract
Motif counting plays a crucial role in understanding the structural properties of networks. By computing motif frequencies, researchers can draw key insights into the structural properties of the underlying network. As networks become increasingly complex, different graph models have been proposed, giving rise to diverse motif patterns. These variations introduce unique computational challenges that require specialized algorithms tailored to specific motifs within different graph structures. This survey provides a comprehensive and structured overview of motif counting techniques across general graphs, heterogeneous graphs, and hypergraphs. We categorize existing algorithms according to their underlying computational strategies, emphasizing key similarities and distinctions. In addition to reviewing current methodologies, we examine their strengths, limitations, and computational trade-offs. Furthermore, we explore future directions in motif counting, including scalable implementations to improve efficiency in large-scale networks, algorithmic adaptations for dynamic, temporal, and attributed graphs, and deeper integration with large language models (LLMs) and graph-based retrieval-augmented generation (GraphRAG). By offering a detailed analysis of these approaches, this survey aims to support researchers and practitioners in advancing motif counting for increasingly complex network data.