Detecting Patterns of Interaction in Temporal Hypergraphs via Edge Clustering

TL;DR

This paper introduces an edge clustering algorithm for temporal hypergraphs that identifies overlapping communities based on interaction patterns, extending traditional graph clustering to more complex hypergraph structures.

Contribution

The paper presents a novel edge clustering method for temporal hypergraphs, enabling detection of overlapping interaction patterns with new similarity functions.

Findings

Identified intuitive clusters in a large collaboration hypergraph

Demonstrated the effectiveness of three different similarity functions

Potential applications in downstream network analysis tasks

Abstract

Finding densely connected subsets of vertices in an unsupervised setting, called clustering or community detection, is one of the fundamental problems in network science. The edge clustering approach instead detects communities by clustering the edges of the graph and then assigning a vertex to a community if it has at least one edge in that community, thereby allowing for overlapping clusters of vertices. We apply the idea behind edge clustering to temporal hypergraphs, an extension of a graph where a single edge can contain any number of vertices and each edge has a timestamp. Extending to hypergraphs allows for many different patterns of interaction between edges, and by defining a suitable structural similarity function, our edge clustering algorithm can find clusters of these patterns. We test the algorithm with three structural similarity functions on a large collaboration hypergraph, and find intuitive cluster structures that could prove useful for downstream tasks.