Community detection in hypergraphs through hyperedge percolation.

ABSTRACT: Complex networks often exhibit community structure, with communities corresponding to denser subgraphs in which nodes are closely linked. When modelling systems where interactions extend beyond node pairs to arbitrary numbers of nodes, hypergraphs become necessary, creating a need for specialised community detection methods. Here, we adapt the classical k-clique percolation method to hypergraphs, constructing communities from hyperedges containing at least k nodes, defining hyperedge adjacency similarly to clique adjacency. Although the analogy between the proposed hyperedge percolation method and the classical clique percolation algorithm is evident, we show that communities obtained directly from the hyperedges can differ from those identified via clique percolation on the pairwise proje

SUBMITTER: Kovacs B 

PROVIDER: S-EPMC12528371 | biostudies-literature | 2025 Oct

REPOSITORIES: biostudies-literature