Work

Higher-order shortest paths in hypergraphs

Year: 2025

Type: article

Abstract: One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with nondyadic, higher-order interactions. Nevertheless, the connectivity properties of real-world hypergraphs remain largely understudied. In this work we introduce path size as a measure to characterize higher-order connectivity and quantify the relevance of nondyadic ties for efficient shortest paths in a diverse set of empirical networks with and without temporal information. By comparing our results with simple randomized null models, our analysis presents a nuanced picture, suggesting that nondyadic ties are often central and are vital for system connectivity, while dyadic edges remain essential to connect more peripheral nodes, an effect which is particularly pronounced for time-varying systems. Our work contributes to a better understanding of the structural organization of systems with higher-order interactions.

Source: Physical review. E

DOI: 10.1103/1mxy-3cnl

Authors: Berné L. Nortier, Simon Dobson, Federico Battiston

Institutions: University of St Andrews, Central European University

Language: English

Topic: Complex Network Analysis Techniques

Subfield: Statistical and Nonlinear Physics

Field: Physics and Astronomy

Domain: Physical Sciences

Open Access status: green

Funders: Austrian Science Fund, Central European University

Awards: The physics of higher-order interaction networks, G9000017597