Open Access
- 26 March 2026
- journal article
- research article
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Abstract
The concept of distance is a fundamental idea in graphs and hypergraphs. However, its extension to weighted hypergraphs is challenging, since it may result in inconsistencies, especially if the weights are arbitrarily assigned to the hyperedges. We address this challenge by proposing a general distance measure for weighted hypergraphs. Our measure is well-defined, and it reduces to the classic graph distance if the edges in the hypergraph are all pairwise links. We demonstrate the applicability of our definition by analyzing a number of real-world higher-order datasets, including the network of preprints in the arXiv repository, for which we choose the weights in a way that reflects the notion of cognitive distance, which measures the conceptual remoteness between fields. Our results demonstrate that, when higher-order edges cannot be neglected, the use of a full hypergraph measure is necessary to avoid the information loss that would result from commonly used approaches, such as clique projection.Keywords
This publication has 15 references indexed in Scilit:
- Higher-order shortest paths in hypergraphsPhysical Review E, 2025
- Hypermodularity and community detection in hypergraphsPhysical Review Research, 2025
- The structural evolution of temporal hypergraphs through the lens of hyper-coresEPJ Data Science, 2024
- Charting mobility patterns in the scientific knowledge landscapeEPJ Data Science, 2024
- The structure and dynamics of networks with higher order interactionsPhysics Reports, 2023
- Generative hypergraph clustering: From blockmodels to modularityScience Advances, 2021
- Networks beyond pairwise interactions: Structure and dynamicsPhysics Reports, 2020
- The structure and dynamics of multilayer networksPhysics Reports, 2014
- Hypergraph Theory2013
- Complex networks: Structure and dynamicsPhysics Reports, 2006