Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 27 min ago
PreprintCC BY 4.0arXiv

Self-averaging enables reconstruction of higher-order chaotic networks

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.

Related

  1. Multiscale Reconstruction of Multiplex Networks with Higher-Order Interactions
    Guangyuan Mei, Yao Cai, Suoyi Tan +4
    arXivPreprintarXiv licenceFull textStatistical & nonlinear physicsarXiv
  2. Higher Order OTOCs in Chaotic Quantum Maps: Ruelle-Pollicott Resonances and Asymptotic Freeness
    Nicolás Gómez Brucks, Ignacio García-Mata, Diego A. Wisniacki
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationStatistical & nonlinear physicsarXiv
  3. Chaotic Griffiths phase in neuron map networks
    Juan Velez-Rojas, M. G. Cosenza
    arXivPreprintCC BY-NC-ND 4.0Full textCondensed matterStatistical & nonlinear physicsarXiv
  4. Autonomous Chaotic Time Series Prediction using Physical Neuromorphic Networks
    Akshaya Rajesh, Yinhao Xu, Wave Ngampruetikorn +1
    arXivPreprintarXiv licenceFull textCondensed matterStatistical & nonlinear physicsarXiv
  5. Online training of Echo State Networks to predict chaotic dynamical systems
    Astero Provata, Markos Syroukis, Johanne Hizanidis
    arXivPreprintCC BY 4.0Full textCondensed matterStatistical & nonlinear physicsarXiv
BibTeX
@misc{he2026selfaveraging,
  title = {{Self-averaging enables reconstruction of higher-order chaotic networks}},
  author = {Jiahao He and Xiaoqun Wu and Ziye Fan and Jianwen Feng and Tingwen Huang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.31155},
  eprint = {2610.31155},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.31155},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Self-averaging enables reconstruction of higher-order chaotic networks
AU  - Jiahao He
AU  - Xiaoqun Wu
AU  - Ziye Fan
AU  - Jianwen Feng
AU  - Tingwen Huang
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.31155
UR  - https://arxiv.org/abs/2610.31155
AB  - 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.
ER  -