{"ID":2822755,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2601.02603","arxiv_id":"2601.02603","title":"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.","short_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 info...","url_abs":"https://arxiv.org/abs/2601.02603","url_pdf":"https://arxiv.org/pdf/2601.02603v1","authors":"[\"Alec Kirkley\",\"Helcio Felippe\",\"Federico Battiston\"]","published":"2026-01-05T23:39:58Z","proceeding":"physics.soc-ph","tasks":"[\"physics.soc-ph\",\"cs.SI\"]","methods":"[]","has_code":false}