Graphs as focal interaction systems in higher-order dynamics
Graphs and hypergraphs are commonly distinguished by the order of the relations they represent, with graphs encoding pairwise relations and hypergraphs encoding interactions among arbitrary groups. We show that, for node-update dynamics, a more natural viewpoint is to regard a graph as a collection of focal neighbourhoods, each centered on a vertex and consisting of the vertex and its neighbours. From this perspective, hypergraphs naturally generalise graph neighbourhoods by allowing arbitrary interaction domains without requiring a distinguished focal node. This viewpoint also clarifies the relationship between graph and hypergraph dynamical models. Although sufficiently general graph-based node functions can reproduce the dynamics of higher-order interactions, such dynamical equivalence does not imply equivalence of the underlying interaction structures. Graph representations may encode higher-order organisation implicitly in their functions while losing the explicit grouping, roles, and symmetries carried by hyperedges. We therefore distinguish dynamical expressivity from structural representation and show that hypergraphs provide a generalisation of graph-based interaction domains even when their dynamics can be emulated by graph models.