Graphs are focal hypergraphs: strict containment in higher-order interaction dynamics
Elka\"ioum M. Moutuou

TL;DR
This paper establishes a hierarchy of interaction models, showing that graphs are a special case of hypergraphs, with the hierarchy grounded in real-world phenomena and emphasizing the importance of choosing models based on interaction types.
Contribution
It introduces a taxonomy of interaction types, demonstrating that graphs are focal hypergraphs and clarifying the relationship between graph and hypergraph dynamical models.
Findings
Graphs are a special case of focal hypergraphs.
Hypergraph models generalize graph neighborhood structures.
The hierarchy is grounded in phenomena from various scientific fields.
Abstract
We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general hypergraph dynamical model. The central distinction is between \emph{focal} interactions, in which the interaction domain is defined relative to a designated reference node, and \emph{non-focal} interactions, in which all participants stand in equivalent structural relationship. Closed graph neighbourhoods are precisely focal hyperedges, so hyperedges generalise graph neighbourhoods by removing the focal constraint. This yields a strict three-level hierarchy: graph models focal hypergraph models general hypergraph models. Moreover, graph models do encode genuinely higher-order (many-body) interactions, in the sense that each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Complex Network Analysis Techniques · Advanced Graph Neural Networks
