Detecting communities in higher-order networks by using their derivative graphs

Gonzalo Contreras-Aso, Regino Criado, Guillermo Vera de Salas and Jinling Yang

Chaos, Solitons & Fractals, 2023, vol. 177, issue C

Abstract: Similar to what happens in the pairwise network domain, the communities of nodes of a hypergraph (also called higher-order network) are formed by groups of nodes that share many hyperedges, so that the number of hyperedges they share with the rest of the nodes is significantly smaller, and therefore these communities can be considered as independent compartments (or super-clusters) of the hypergraph. In this work we present a method, based on the so-called derivative graph of a hypergraph, which allows the detection of communities of a higher-order network without high computational cost and several simulations are presented that show the significant computational advantages of the proposed method over other existing methods.

Keywords: Hypergraph; Derivative of a hypergraph; Higher-order network; Community; Communities in a hypergraph; UPGMA; Hierarchical clustering (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077923011025
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:177:y:2023:i:c:s0960077923011025

DOI: 10.1016/j.chaos.2023.114200

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().