The simpliciality of higher-order networks

Abstract Higher-order networks are widely used to describe complex systems in which interactions can involve more than two entities at once. In this paper, we focus on inclusion within higher-order networks, referring to situations where specific entities participate in an interaction, and subsets o...

Full description

Bibliographic Details
Main Authors: Nicholas W. Landry, Jean-Gabriel Young, Nicole Eikmeier
Format: Article
Language:English
Published: SpringerOpen 2024-03-01
Series:EPJ Data Science
Subjects:
Online Access:https://doi.org/10.1140/epjds/s13688-024-00458-1
_version_ 1797266946071199744
author Nicholas W. Landry
Jean-Gabriel Young
Nicole Eikmeier
author_facet Nicholas W. Landry
Jean-Gabriel Young
Nicole Eikmeier
author_sort Nicholas W. Landry
collection DOAJ
description Abstract Higher-order networks are widely used to describe complex systems in which interactions can involve more than two entities at once. In this paper, we focus on inclusion within higher-order networks, referring to situations where specific entities participate in an interaction, and subsets of those entities also interact with each other. Traditional modeling approaches to higher-order networks tend to either not consider inclusion at all (e.g., hypergraph models) or explicitly assume perfect and complete inclusion (e.g., simplicial complex models). To allow for a more nuanced assessment of inclusion in higher-order networks, we introduce the concept of “simpliciality” and several corresponding measures. Contrary to current modeling practice, we show that empirically observed systems rarely lie at either end of the simpliciality spectrum. In addition, we show that generative models fitted to these datasets struggle to capture their inclusion structure. These findings suggest new modeling directions for the field of higher-order network science.
first_indexed 2024-04-25T01:08:46Z
format Article
id doaj.art-d95367465310442b94d059b32413d9d7
institution Directory Open Access Journal
issn 2193-1127
language English
last_indexed 2024-04-25T01:08:46Z
publishDate 2024-03-01
publisher SpringerOpen
record_format Article
series EPJ Data Science
spelling doaj.art-d95367465310442b94d059b32413d9d72024-03-10T12:08:14ZengSpringerOpenEPJ Data Science2193-11272024-03-0113112010.1140/epjds/s13688-024-00458-1The simpliciality of higher-order networksNicholas W. Landry0Jean-Gabriel Young1Nicole Eikmeier2Vermont Complex Systems Center, University of VermontVermont Complex Systems Center, University of VermontDepartment of Computer Science, Grinnell CollegeAbstract Higher-order networks are widely used to describe complex systems in which interactions can involve more than two entities at once. In this paper, we focus on inclusion within higher-order networks, referring to situations where specific entities participate in an interaction, and subsets of those entities also interact with each other. Traditional modeling approaches to higher-order networks tend to either not consider inclusion at all (e.g., hypergraph models) or explicitly assume perfect and complete inclusion (e.g., simplicial complex models). To allow for a more nuanced assessment of inclusion in higher-order networks, we introduce the concept of “simpliciality” and several corresponding measures. Contrary to current modeling practice, we show that empirically observed systems rarely lie at either end of the simpliciality spectrum. In addition, we show that generative models fitted to these datasets struggle to capture their inclusion structure. These findings suggest new modeling directions for the field of higher-order network science.https://doi.org/10.1140/epjds/s13688-024-00458-1Higher-order networkHypergraphSimplicial complexSimpliciality
spellingShingle Nicholas W. Landry
Jean-Gabriel Young
Nicole Eikmeier
The simpliciality of higher-order networks
EPJ Data Science
Higher-order network
Hypergraph
Simplicial complex
Simpliciality
title The simpliciality of higher-order networks
title_full The simpliciality of higher-order networks
title_fullStr The simpliciality of higher-order networks
title_full_unstemmed The simpliciality of higher-order networks
title_short The simpliciality of higher-order networks
title_sort simpliciality of higher order networks
topic Higher-order network
Hypergraph
Simplicial complex
Simpliciality
url https://doi.org/10.1140/epjds/s13688-024-00458-1
work_keys_str_mv AT nicholaswlandry thesimplicialityofhigherordernetworks
AT jeangabrielyoung thesimplicialityofhigherordernetworks
AT nicoleeikmeier thesimplicialityofhigherordernetworks
AT nicholaswlandry simplicialityofhigherordernetworks
AT jeangabrielyoung simplicialityofhigherordernetworks
AT nicoleeikmeier simplicialityofhigherordernetworks