Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
arXiv (Cornell University)(2023)
摘要
Bipartite graphs characterize relationships between two different sets of
entities, like actor-movie, user-item, and author-paper. The butterfly, a
4-vertices 4-edges (2,2)-biclique, is the simplest cohesive motif in a
bipartite graph and is the fundamental component of higher-order substructures.
Counting and enumerating the butterflies offer significant benefits across
various applications, including fraud detection, graph embedding, and community
search. While the corresponding motif, the triangle, in the unipartite graphs
has been widely studied in both static and temporal settings, the extension of
butterfly to temporal bipartite graphs remains unexplored. In this paper, we
investigate the temporal butterfly counting and enumeration problem: count and
enumerate the butterflies whose edges establish following a certain order
within a given duration. Towards efficient computation, we devise a non-trivial
baseline rooted in the state-of-the-art butterfly counting algorithm on static
graphs, further, explore the intrinsic property of the temporal butterfly, and
develop a new optimization framework with a compact data structure and
effective priority strategy. The time complexity is proved to be significantly
reduced without compromising on space efficiency. In addition, we generalize
our algorithms to practical streaming settings and multi-core computing
architectures. Our extensive experiments on 11 large-scale real-world datasets
demonstrate the efficiency and scalability of our solutions.
更多查看译文
关键词
bipartite graphs,temporal,enumeration
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要