It is proved that networks of n nodes with local dimension d can be exactly reduced from n d dimensions to a fixed macroscopic system of dimension m d, where m is the number of fundamental solutions required by the nodal dynamics.
Abstract
We establish a unified framework for exact dimensional reductions in network dynamical systems using Lie-Scheffers theory. For network dynamical systems with \emph{mean-field Lie-Scheffers structure}, we prove that networks of $n$ nodes with local dimension $d$ can be exactly reduced from $ n d $ dimensions to a fixed macroscopic system of dimension $ m d $, where $m$ is the number of fundamental solutions required by the nodal dynamics. Crucially, the superposition principle resulting from the Lie-algebraic structure allows the mean-field coupling to be expressed explicitly in terms of the macroscopic variables, yielding a \emph{closed} self-consistent system independent of network size. This reduction collapses the high-dimensional network flow onto invariant manifolds parameterized by $ \gamma = d(n-m) $ independent constants of motion. Our framework rigorously explains known reductions and provides a \emph{systematic method to discover new ones}. We illustrate the theory with ensembles of Riccati equations (encompassing the Kuramoto model and Theta neuron model), quasi-linear ODEs, and generalized Bernoulli equations, explicitly deriving the macroscopic flows and conserved quantities for each case.
A one-dimensional reduction for dynamical systems on networks with purely higher-order interactions is developed, formulated through an effective higher-order interaction strength, associated with the triangular interactions of the underlying network and the dynamical system's effective state.
Amit Tiwari, C. Hens, Prosenjit Kundu· Proceedings of the Royal Soc...· 1 citation
We derive a one-dimensional reduction for nonlinear dynamics on simplicial complexes containing both pairwise and triangular (higher-order) interactions. The effective state is defined using a mixed weight determined by the pairwise and triangular degrees of each node. The resulting reduced equation retains two structu...
Amit Tiwari, C. Hens, Prosenjit Kundu· 0 citations
Within the scope of the qualitative study of dynamical systems via graph-based methods, we extend the notion of structural graph to dynamical systems generated by actions of monoids, as abstract algebraic structures. The setting considers the action of an ordered monoid (not necessarily \(\mathbb{N},\ \mathbb{Z}\) or \...
Bouchra Tarhzout, A. Ouadfel, F. Zinoun· International Journal of Ana...· 0 citations
We focus on a stochastic system that models a collection of $N$ identical oscillators with unidirectional coupling, perturbed by white noise. The unidirectional coupling breaks the symmetry of mutual dependence among the oscillators. It is shown that the associated random dynamical system $\phi$ admits a dynamical orde...
Classical fractons are Hamiltonian systems that can develop attractors after projection onto configuration or shape variables, although the full phase space admits none. We study a scale-invariant, dipole-conserving two-parameter family of fracton Hamiltonians $H_{\alpha,\beta}$. By separating coordinates into scale an...
A. Singh, Dileep P. Jatkar, S. L. Sondhi et al.· 1 citation
We establish marginal and functional convex order comparisons for graphon mean-field systems on $\mathbb{R}^d$, including the infinite-horizon setting. A key difficulty is that convex order cannot in general be transferred through the usual particle approximation, which requires us to work directly with Euler schemes f...