Pith. sign in

REVIEW

Reconstructing dynamics of complex systems from noisy time series with hidden variables

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.19159 v1 pith:2R44B2GO submitted 2023-04-10 nlin.AO physics.data-an

Reconstructing dynamics of complex systems from noisy time series with hidden variables

classification nlin.AO physics.data-an
keywords dynamicscomplexnetworksdimensionsevenframeworkhighnoisy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Reconstructing the equation of motion and thus the network topology of a system from time series is a very important problem. Although many powerful methods have been developed, it remains a great challenge to deal with systems in high dimensions with partial knowledge of the states. In this paper, we propose a new framework based on a well-designed cost functional, the minimization of which transforms the determination of both the unknown parameters and the unknown state evolution into parameter learning. This method can be conveniently used to reconstruct structures and dynamics of complex networks, even in the presence of noisy disturbances or for intricate parameter dependence. As a demonstration, we successfully apply it to the reconstruction of different dynamics on complex networks such as coupled Lorenz oscillators, neuronal networks, phase oscillators and gene regulation, from only a partial measurement of the node behavior. The simplicity and efficiency of the new framework makes it a powerful alternative to recover system dynamics even in high dimensions, which expects diverse applications in real-world reconstruction.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.