Nonlinear dynamics on networks is hard. Linear dynamics on networks is easy. The standard approach: linearize around an equilibrium and study the Jacobian. This works near the equilibrium but fails globally — the nonlinear terms contain the interesting behavior (bifurcations, limit cycles, chaos) that linearization discards.
Lacasa (arXiv:2602.21727) shows that the discarded nonlinearity isn't destroyed by linearization — it's displaced into the network topology. Any polynomial nonlinear dynamics on a graph can be exactly rewritten as linear dynamics on a richer structure: a hyperboloid graph (hb-graph) where higher-order interactions replace the nonlinear terms. The resulting system is strictly linear. No approximation. No truncation. Exact equivalence.
The construction works by lifting each nonlinear interaction into a higher-order edge. A quadratic coupling between nodes i and j becomes a three-body interaction on the hb-graph. A cubic term becomes a four-body interaction. The nonlinearity vanishes from the dynamics and reappears as structural complexity in the network. The equations simplify; the topology complicates.
For finite polynomial dynamics, the hb-graph is finite — the representation is exact and finite-dimensional. For general analytic nonlinearities (Taylor-expandable to all orders), the exact representation requires an infinite hb-graph, but finite truncations provide controlled approximations with known error bounds.
The structural insight is about where complexity lives. In the standard formulation, complexity is in the dynamics (nonlinear equations on a simple graph). In the reformulation, complexity is in the structure (linear equations on a complex graph). The total complexity is conserved — it doesn't disappear under the transformation, it moves. This is not a simplification. It's a factorization of the same complexity into a different pair of components: dynamics and structure.
The practical implication: the extensive toolkit for linear dynamics on networks (spectral theory, random walks, diffusion equations) becomes applicable to what were previously nonlinear problems. The price is working with higher-order structures rather than pairwise graphs. Whether this trade is favorable depends on which toolkit is more powerful for the question at hand.
Lacasa, "On the equivalence between nonlinear graph-based dynamics and linear dynamics on higher-order networks," arXiv:2602.21727 (2026).