Hypergraph clustering using Ricci curvature: an edge transport perspective
This work addresses community detection in hypergraphs, an incremental advancement in graph theory with potential applications in network analysis.
The authors tackled community detection in hypergraphs by introducing a novel Ricci flow method using edge transport, which proved more sensitive to hypergraph structure than clique expansion methods, especially for large hyperedges.
In this paper, we introduce a novel method for extending Ricci flow to hypergraphs by defining probability measures on the edges and transporting them on the line expansion. This approach yields a new weighting on the edges, which proves particularly effective for community detection. We extensively compare this method with a similar notion of Ricci flow defined on the clique expansion, demonstrating its enhanced sensitivity to the hypergraph structure, especially in the presence of large hyperedges. The two methods are complementary and together form a powerful and highly interpretable framework for community detection in hypergraphs.