Hypermodularity and community detection in hypergraphs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: del Genio, Charo I.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913928783593472
author del Genio, Charo I.
author_facet del Genio, Charo I.
contents Numerous networked systems feature a structure of nontrivial communities, which often correspond to their functional modules. Such communities have been detected in real-world biological, social and technological systems, as well as in synthetic models thereof. While much effort has been devoted to developing methods for community detection in traditional networks, the study of community structure in networks with higher-order interactions is still not as extensively explored. In this article, we introduce a formalism for the hypermodularity of higher-order networks that allows us to use spectral methods to detect community structures in hypergraphs. We apply this approach to synthetic random networks as well as to real-world data, showing that it produces results that reflect the nature and the dynamics of the interactions modelled, thereby constituting a valuable tool for the extraction of hidden information from complex higher-order data sets.
format Preprint
id arxiv_https___arxiv_org_abs_2412_06935
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Hypermodularity and community detection in hypergraphs
del Genio, Charo I.
Physics and Society
Disordered Systems and Neural Networks
Social and Information Networks
Numerous networked systems feature a structure of nontrivial communities, which often correspond to their functional modules. Such communities have been detected in real-world biological, social and technological systems, as well as in synthetic models thereof. While much effort has been devoted to developing methods for community detection in traditional networks, the study of community structure in networks with higher-order interactions is still not as extensively explored. In this article, we introduce a formalism for the hypermodularity of higher-order networks that allows us to use spectral methods to detect community structures in hypergraphs. We apply this approach to synthetic random networks as well as to real-world data, showing that it produces results that reflect the nature and the dynamics of the interactions modelled, thereby constituting a valuable tool for the extraction of hidden information from complex higher-order data sets.
title Hypermodularity and community detection in hypergraphs
topic Physics and Society
Disordered Systems and Neural Networks
Social and Information Networks
url https://arxiv.org/abs/2412.06935