ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
This addresses computational challenges in analyzing dynamic hypergraphs for researchers and practitioners in network science, though it is incremental as it builds on existing triad counting methods with a focus on efficiency.
The paper tackles the problem of efficiently analyzing large dynamic hypergraphs, specifically for triad counting, by proposing ESCHER, a GPU-centric data structure and update framework, achieving speedups of up to 104.5x to 473.7x over existing methods.
Higher-order interactions beyond pairwise relationships in large complex networks are often modeled as hypergraphs. Analyzing hypergraph properties such as triad counts is essential, as hypergraphs can reveal intricate group interaction patterns that conventional graphs fail to capture. In real-world scenarios, these networks are often large and dynamic, introducing significant computational challenges. Due to the absence of specialized software packages and data structures, the analysis of large dynamic hypergraphs remains largely unexplored. Motivated by this gap, we propose ESCHER, a GPU-centric parallel data structure for Efficient and Scalable Hypergraph Evolution Representation, designed to manage large scale hypergraph dynamics efficiently. We also design a hypergraph triad-count update framework that minimizes redundant computation while fully leveraging the capabilities of ESCHER for dynamic operations. We validate the efficacy of our approach across multiple categories of hypergraph triad counting, including hyperedge-based, incident-vertex-based, and temporal triads. Empirical results on both large real-world and synthetic datasets demonstrate that our proposed method outperforms existing state-of-the-art methods, achieving speedups of up to 104.5x, 473.7x, and 112.5x for hyperedge-based, incident-vertex-based, and temporal triad types, respectively.