Graphs are focal hypergraphs: strict containment in higher-order interaction dynamics

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 $\subsetneq$ focal hypergraph models $\subsetneq$ general hypergraph models. Moreover, graph models do encode genuinely higher-order (many-body) interactions, in the sense that each node's update function may depend jointly on all members of its closed neighbourhood, but they remain a strict special case of the hypergraph dynamical model, not equivalent to it. We further show that universal encodings such as bipartite factor graphs are neutral with respect to this hierarchy, and that the symmetry condition of the hypergraph dynamical model -- often treated as an additional constraint relative to the graph model -- is in fact the dynamical definition of a non-focal interaction. The taxonomy is grounded in concrete phenomena from physics, biology, ecology, and social systems, and yields a principle of representational alignment: the choice between graph and hypergraph models should be governed by the type of interaction, not by a blanket preference for one formalism over the other.

• Publication year

  2026

• Venue

  Unknown venue

• Publication date

  2026-03-04

• Fields of study

  Physics, Linguistics, Computer Science

• Identifiers
  arXiv 2603.04215
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Graphs are maximally expressive for higher-order interactions

  2026influential reference
• Topology and spectral interconnectivities of higher-order multilayer networks

  2023cited by this paper
• What are higher-order networks?

  2021cited by this paper
• Dynamical systems on hypergraphs

  2020cited by this paper
• Coupled dynamics on hypergraphs: Master stability of steady states and synchronization.

  2020cited by this paper
• The why, how, and when of representations for complex systems

  2020cited by this paper
• Networks beyond pairwise interactions: structure and dynamics

  2020cited by this paper
• From networks to optimal higher-order models of complex systems

  2019cited by this paper
• High-order epistasis shapes evolutionary trajectories

  2017cited by this paper
• The Influence of Higher-Order Epistasis on Biological Fitness Landscape Topography

  2017cited by this paper
• Higher-order interactions stabilize dynamics in competitive network models

  2017cited by this paper
• Higher-order organization of complex networks

  2016cited by this paper
• An Introduction to Systems Biology Design Principles of Biological Circuits

  2007cited by this paper
• Network motifs: theory and experimental approaches

  2007cited by this paper
• Bacterially speaking.

  2006cited by this paper
• Network motifs in the transcriptional regulation network of Escherichia coli

  2002cited by this paper
• Correlated Equilibrium as an Expression of Bayesian Rationality Author ( s )

  1987cited by this paper
• Subjectivity and Correlation in Randomized Strategies

  1974cited by this paper
• A Note on Trophic Complexity and Community Stability

  1969cited by this paper
• Food Web Complexity and Species Diversity

  1966cited by this paper
• Pion Theory of Three-Body Forces

  1957cited by this paper
• Graphs and Hypergraphs

  year unknowncited by this paper

• No citing papers are available for this paper.