Inverse problems for dynamic patterns in coupled oscillator networks: when larger networks are simpler

Networks of coupled phase oscillators are one of the most studied dynamical systems with numerous applications in physics, chemistry, biology, and engineering. Their behaviour is often characterized by the emergence of various partially synchronized dynamic patterns, which in the case of large networks can be analysed using a variant of the mean-field approach. This method allows to predict what type of network dynamics can be observed for different system parameters. But it is less known that for different partially synchronized patterns it also allows to obtain statistical equilibrium relations that express the dependence of some time-averaged observable quantities of individual oscillators on the internal parameters of these oscillators and the interaction functions between them. In this paper, we show how such relations can be derived, what their typical accuracy is for finite-size networks, and how they can be used to reconstruct the parameters of the corresponding model. The proposed method is particularly effective for large networks, for unevenly sampled or noisy observables, and for partial observations. Its possibilities are demonstrated by application to chimera states in networks of phase oscillator with nonlocal coupling. The extension of the method to other systems with all-to-all and random network topologies is also described.

Authors

Institutions

Publication Details

Journal
Nature Communications
Published
2026-02-27
DOI
https://doi.org/10.1038/s41467-026-70016-y
Primary Topic
Nonlinear Dynamics and Pattern Formation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Inverse problems for dynamic patterns in coupled oscillator networks: when larger networks are simpler

Oleh E. Omel’chenko
Nature Communications
Nonlinear Dynamics and Pattern Formation
article

Inverse problems for dynamic patterns in coupled oscillator networks: when larger networks are simpler

Oleh E. Omel’chenko
article en

Abstract

Networks of coupled phase oscillators are one of the most studied dynamical systems with numerous applications in physics, chemistry, biology, and engineering. Their behaviour is often characterized by the emergence of various partially synchronized dynamic patterns, which in the case of large networks can be analysed using a variant of the mean-field approach. This method allows to predict what type of network dynamics can be observed for different system parameters. But it is less known that for different partially synchronized patterns it also allows to obtain statistical equilibrium relations that express the dependence of some time-averaged observable quantities of individual oscillators on the internal parameters of these oscillators and the interaction functions between them. In this paper, we show how such relations can be derived, what their typical accuracy is for finite-size networks, and how they can be used to reconstruct the parameters of the corresponding model. The proposed method is particularly effective for large networks, for unevenly sampled or noisy observables, and for partial observations. Its possibilities are demonstrated by application to chimera states in networks of phase oscillator with nonlocal coupling. The extension of the method to other systems with all-to-all and random network topologies is also described.

Nature CommunicationsVol. 17(1)
University of Potsdam (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 50%
Nonlinear Dynamics and Pattern Formation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.