Skip to content
Preprint

Self-averaging enables reconstruction of higher-order chaotic networks

Oct 2026 · 0 citations · 45 references
Physics

Abstract

Higher-order interactions create a combinatorial space of candidate dynamical terms, making network reconstruction difficult when node dynamics, coupling functions and interaction topology are unknown. Here we identify a regime in which weakly coupled higher-order chaotic networks admit a higher-order interaction reduction. Weak coupling largely preserves the statistical structure of intrinsic chaotic motion, while dense higher-order neighborhoods provide repeated sampling of weakly correlated multi-node inputs received by hub nodes. Consequently, the aggregate interaction field can be represented by a compact function of the hub state, together with a node-dependent offset and finite-neighborhood fluctuations. We exploit this reduction to learn dynamically relevant coupling forms and reconstruct interactions of different orders by sparse regression. Numerical experiments validate the effectiveness of the framework within an effective region of the tested coupling-parameter space, including representative weak-coupling settings. Reconstruction remains stable at the larger network sizes and higher hub-neighborhood densities examined. Additional tests on networks constructed from empirical topologies show that structural priors reduce data requirements and that the framework remains applicable to heterogeneous chaotic dynamics. These results identify reduction of aggregate higher-order inputs as an interpretable route to dimensional compression and joint dynamical and structural reconstruction.

View source

Similar papers

Preprint Nov 2026

Resolving the backbone of multiscale interactions through mutual information rates

Natural systems are often composed of processes evolving on multiple timescales and coupled through complex interaction networks. Inferring such networks is especially challenging when timescales are widely separated, since resolving the fastest processes while accurately sampling the slowest ones is generally prohibit...

Alberto Raiola, G. Nicoletti, D. M. Busiello · 0 citations
Preprint Sep 2026

Dimension-dependent order parameter selection in higher-order Kuramoto dynamics on spheres: continuous versus quantized regimes

We study a high-dimensional Kuramoto model with attractive pairwise coupling and a repulsive higher-order effect. Although the pairwise interaction favors synchronization, the higher-order interaction prevents complete synchronization and selects an intermediate level of coherence corresponding to the balanced equilibr...

Hyungjin Huh, Dohyun Kim · 0 citations
Preprint Sep 2026

Stochastic Dynamics of Large-Scale Motif-Embedded Spiking Neuronal Networks

We examine how local motif structure and global network topology jointly shape spiking dynamics in stochastic neuronal networks. Using networks of Izhikevich neurons with Erd\H{o}s-R\'enyi (ER) and scale-free (SF) background connectivity, we compare motif-embedded networks with synapse-count-matched, non-motif controls...

Gurpreet Jagdev, R. Bertram, Na Yu · 0 citations
Preprint Oct 2026

Higher-Order Kolmogorov-Arnold Networks for Dynamics

The ability to derive the governing equations of a dynamical system from data is essential for prediction and control across many scientific fields. Two challenges, however, are the expansion of candidate terms when reducing higher-order equations to first-order form and noise from estimating derivatives. We propose Hi...

Kevin Slote, J. Fish · 0 citations
Preprint Nov 2026

Cup and cap synchronization: higher-order node dynamics from topology

Higher-order node-based synchronization provides distinct mechanisms for discontinuous synchronization transitions. However, a comprehensive theoretical framework capable of encompassing existing models and revealing the role of higher-order interactions beyond triangles is still missing. Here, combining algebraic topo...

Run-Yue Wang, Yuan-Zhao Zhang, G. Bianconi · 0 citations
Open access Oct 2026

Structure Matched Higher Order Reservoir Computing for Complex System Prediction

Conventional reservoir computing (RC) provides an efficient framework for chaotic time series prediction, but its random input mapping and pairwise reservoir connections do not explicitly reflect the higher order relations that often govern nonlinear dynamical systems. This paper proposes a structure matched higher o...

Xu Liu, Li-Yue Zhang, Song-Sui Li et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.