Structural reducibility of hypergraphs
By: Alec Kirkley, Helcio Felippe, Federico Battiston
Potential Business Impact:
Finds important connections in complicated groups.
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.
Similar Papers
Higher-order shortest paths in hypergraphs
Physics and Society
Measures how important group connections are for speed.
The topology of synergy: linking topological and information-theoretic approaches to higher-order interactions in complex systems
Information Theory
Finds hidden patterns in brain signals.
Learning Multi-Order Block Structure in Higher-Order Networks
Social and Information Networks
Finds hidden groups in complex connections.