Coarse-grained description of general oscillator networks
classification
🌊 nlin.AO
cond-mat.stat-mech
keywords
methodoscillatorbifurcationcoarse-grainedcoarse-grainingequationsnetworksapplying
read the original abstract
We propose a novel and systematic method for coarse-graining oscillator networks described by phase equations. Our coarse-graining method enables us to obtain the closed coarse-grained equations for a few effective eigenmodes, which is based on the eigenvalue problem of the linearized system around the phase-locked solution and a nonlinear transformation. We demonstrate our method by applying it to oscillator dynamics on a random graph, which exhibits a saddle-node bifurcation at the bifurcation point.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Uncertainty-Aware Sparse Identification of Dynamical Systems via Bayesian Model Averaging
A Bayesian sparse identification framework using model averaging recovers interaction structures in dynamical systems with quantified uncertainty in term inclusion.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.