Motif Counting in Complex Networks: A Comprehensive Survey
ACM Computing Surveys · 31.01.2027 · 59 (1) · 1-36
DOI: 10.1145/3844607 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Computing Surveys, online erschienen am 30.10.2026. Verfasst von Haozhe Yin und 5 weiteren Autor:innen. Die Arbeit nennt 171 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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 tradeoffs. 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 at supporting researchers and practitioners in advancing motif counting for increasingly complex network data.
Zitieren
APA
Yin, H., Wang, K., Zhang, W., He, Y., Zhang, Y., & Lin, X. (2027). Motif Counting in Complex Networks: A Comprehensive Survey. ACM Computing Surveys, 59(1), 1-36. https://doi.org/10.1145/3844607
Vancouver
Yin H, Wang K, Zhang W, He Y, Zhang Y, Lin X. Motif Counting in Complex Networks: A Comprehensive Survey. ACM Computing Surveys. 2027;59(1):1-36. doi:10.1145/3844607
BibTeX
@article{Yin2027,
author = {Yin, Haozhe and Wang, Kai and Zhang, Wenjie and He, Yizhang and Zhang, Ying and Lin, Xuemin},
title = {Motif Counting in Complex Networks: A Comprehensive Survey},
journal = {ACM Computing Surveys},
year = {2027},
volume = {59},
number = {1},
pages = {1--36},
doi = {10.1145/3844607}
}
EUVIMED