Structural Reducibility of Hypergraphs
- 12 December 2025
- journal article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 135 (24) , 247401
Abstract
Higher-order interactions provide a nuanced understanding of the relational structure of complex systems beyond traditional pairwise interactions. However, higher-order network analyses also incur more cumbersome interpretations and greater computational demands than their pairwise counterparts. Here, we present an information-theoretic framework for determining the extent to which a hypergraph representation of a networked system is structurally redundant and for identifying its most critical higher orders of interaction that allow us to remove these redundancies while preserving essential higher-order structure.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China
- Excellent Young Scientists Fund (12405044)
- Austrian Science Fund (10.55776/PAT1052824)
- Austrian Science Fund (10.55776/PAT1652425)
This publication has 39 references indexed in Scilit:
- Patterns of neuronal synchrony in higher-order networksPhysics of Life Reviews, 2024
- Higher-order correlations reveal complex memory in temporal hypergraphsNature Communications, 2024
- Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexesNature Communications, 2023
- Inference of hyperedges and overlapping communities in hypergraphsNature Communications, 2022
- Higher-Order Networks2021
- The physics of higher-order interactions in complex systemsNature Physics, 2021
- Evolutionary dynamics of higher-order interactions in social networksNature Human Behaviour, 2021
- Networks beyond pairwise interactions: Structure and dynamicsPhysics Reports, 2020
- Simplicial models of social contagionNature Communications, 2019
- Structural reducibility of multilayer networksNature Communications, 2015