Abstract Suppose we are given a system of coupled oscillators on an unknown graph along with the trajectory of the system during some period. Can we predict whether the system will eventually synchronize? Even with a known underlying graph structure, this is an important yet analytically intractable question in general. In this work, we take an alternative approach to the synchronization prediction problem by viewing it as a classification problem based on the fact that any given system will eventually synchronize or converge to a non-synchronizing limit cycle. By only using some basic statistics of the underlying graphs such as edge density and diameter, our method can achieve perfect accuracy when there is a significant difference in the topology of the underlying graphs between the synchronizing and the non-synchronizing examples. However, in the problem setting where these graph statistics cannot distinguish the two classes very well (e.g., when the graphs are generated from the same random graph model), we find that pairing a few iterations of the initial dynamics along with the graph statistics as the input to our classification algorithms can lead to significant improvement in accuracy; far exceeding what is known by the classical oscillator theory. More surprisingly, we find that in almost all such settings, dropping out the basic graph statistics and training our algorithms with only initial dynamics achieves nearly the same accuracy. We demonstrate our method on three models of continuous and discrete coupled oscillators—the Kuramoto model, Firefly Cellular Automata, and Greenberg-Hastings model. Finally, we also propose an “ensemble prediction” algorithm that successfully scales our method to large graphs by training on dynamics observed from multiple random subgraphs.
more »
« less
This content will become publicly available on November 25, 2024
A latent linear model for nonlinear coupled oscillators on graphs
A system of coupled oscillators on an arbitrary graph is locally driven by the tendency to mutual synchronization be- tween nearby oscillators, but can and often exhibit nonlinear behavior on the whole graph. Understanding such nonlin- ear behavior has been a key challenge in predicting whether all oscillators in such a system will eventually synchronize. In this paper, we demonstrate that, surprisingly, such nonlinear behavior of coupled oscillators can be effectively lin- earized in certain latent dynamic spaces. The key insight is that there is a small number of ‘latent dynamics filters’, each with a specific association with synchronizing and non-synchronizing dynamics on subgraphs so that any observed dynamics on subgraphs can be approximated by a suitable linear combination of such elementary dynamic patterns. Taking an ensemble of subgraph-level predictions provides an interpretable predictor for whether the system on the whole graph reaches global synchronization. We propose algorithms based on supervised matrix factorization to learn such latent dynamics filters. We demonstrate that our method performs competitively in synchronization prediction tasks against baselines and black-box classification algorithms, despite its simple and interpretable architecture.
more »
« less
- Award ID(s):
- 2232241
- NSF-PAR ID:
- 10535228
- Publisher / Repository:
- arXiv
- Date Published:
- Journal Name:
- arXiv
- ISSN:
- NA
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We study the effect of structured higher-order interactions on the collective behavior of coupled phase oscillators. By combining a hypergraph generative model with dimensionality reduction techniques, we obtain a reduced system of differential equations for the system’s order parameters. We illustrate our framework with the example of a hypergraph with hyperedges of sizes 2 (links) and 3 (triangles). For this case, we obtain a set of two coupled nonlinear algebraic equations for the order parameters. For strong values of coupling via triangles, the system exhibits bistability and explosive synchronization transitions. We find conditions that lead to bistability in terms of hypergraph properties and validate our predictions with numerical simulations. Our results provide a general framework to study the synchronization of phase oscillators in hypergraphs, and they can be extended to hypergraphs with hyperedges of arbitrary sizes, dynamic-structural correlations, and other features.more » « less
-
null (Ed.)Abstract Noise is expected to play an important role in the dynamics of analog systems such as coupled oscillators which have recently been explored as a hardware platform for application in computing. In this work, we experimentally investigate the effect of noise on the synchronization of relaxation oscillators and their computational properties. Specifically, in contrast to its typically expected adverse effect, we first demonstrate that a common white noise input induces frequency locking among uncoupled oscillators. Experiments show that the minimum noise voltage required to induce frequency locking increases linearly with the amplitude of the oscillator output whereas it decreases with increasing number of oscillators. Further, our work reveals that in a coupled system of oscillators—relevant to solving computational problems such as graph coloring, the injection of white noise helps reduce the minimum required capacitive coupling strength. With the injection of noise, the coupled system demonstrates frequency locking along with the desired phase-based computational properties at 5 × lower coupling strength than that required when no external noise is introduced. Consequently, this can reduce the footprint of the coupling element and the corresponding area-intensive coupling architecture. Our work shows that noise can be utilized as an effective knob to optimize the implementation of coupled oscillator-based computing platforms.more » « less
-
While coordinated control of a large population of electric loads can provide important services to the electric grid, situations have been observed where control of load ensembles may lead to undesirable, highly nonlinear behavior such as synchronization, sustained oscillations and bifurcations. In this paper, we investigate the synchronizing tendency of thermostatically controlled loads (TCLs) under control strategies where updates are broadcast periodically for coordinating TCLs. We study the problem using a hybrid dynamical systems framework to model both the continuous and discrete dynamics of load ensembles. Analysis of eigenmodes of the underlying discrete-time system provide insights into synchronizing tendencies and rate of convergence to the synchronized state. Simulations are provided to illustrate the theory.more » « less
-
Synchronization is crucial for the correct functi- onality of many natural and man-made complex systems. In this work we characterize the formation of synchronization patterns in networks of Kuramoto oscillators. Specifically, we reveal conditions on the network weights, structure and on the oscillators’ natural frequencies that allow the phases of a group of oscillators to evolve cohesively, yet independently from the phases of oscillators in different clusters. Our conditions are applicable to general directed and weighted networks of heterogeneous oscillators. Surprisingly, although the oscillators exhibit nonlinear dynamics, our approach relies entirely on tools from linear algebra and graph theory. Further, we develop a control mechanism to determine the smallest (as measured by the Frobenius norm) network perturbation to ensure the formation of a desired synchronization pattern. Our procedure allows us to constrain the set of edges that can be modified, thus enforcing the sparsity structure of the network perturbation. The results are validated through a set of numerical examples.more » « less
