arXiv · 2601.02603
Structural reducibility of hypergraphs
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.
Explore related subjects
Keep this discovery
Alec Kirkley, Helcio Felippe, Federico Battiston. 2026-01-05. Structural reducibility of hypergraphs. https://arxiv.org/abs/2601.02603
Cite the original work for its findings. Save a collection to share your selection of sources.