Related papers: Sparse Network Optimization for Synchronization
A recently proposed dimensional reduction approach for studying synchronization in the Kuramoto model is employed to build optimal network topologies to favor or to suppress synchronization. The approach is based in the introduction of a…
Kuramoto model is one of the most prominent models for the synchronization of coupled oscillators. It has long been a research hotspot to understand how natural frequencies, the interaction between oscillators, and network topology…
Sparse, irregular graphs show up in various applications like linear algebra, machine learning, engineering simulations, robotic control, etc. These graphs have a high degree of parallelism, but their execution on parallel threads of modern…
The Kuramoto model is a classical nonlinear ODE system designed to study synchronization phenomena. Each equation represents the phase of an oscillator and the coupling between them is determined by a graph. There is an increasing interest…
The Kuramoto model (KM) of coupled phase oscillators on scale free graphs is analyzed in this work. The W-random graph model is used to define a convergent family of sparse graphs with power law degree distribution. For the KM on this…
We investigate synchronization in networks of Kuramoto oscillators with inertia. More specifically, we introduce a rewiring algorithm consisting basically in a {\em hill climb} scheme in which the edges of the network are swapped in order…
Despite growing interest in synchronization dynamics over "higher-order" network models, optimization theory for such systems is limited. Here, we study a family of Kuramoto models inspired by algebraic topology in which oscillators are…
The Kuramoto model is one of the most widely studied model for describing synchronization behaviors in a network of coupled oscillators, and it has found a wide range of applications. Finding all possible frequency synchronization…
We study the homogeneous Kuramoto model on a graph and the geometry of its underlying optimization landscape $\min_{\boldsymbol \theta \in \mathbb R^n}-\sum_{1\leq i,j\leq n} A_{ij}\cos(\theta_i-\theta_j).$ This problem admits a dual…
Synchronization is a fundamental phenomenon in complex systems, observed across a wide range of natural and engineered contexts. The Kuramoto model provides a foundational framework for understanding synchronization among coupled…
We aim to learn a sparse and connected graph from sparse data, where the number of observations K can be substantially smaller than the signal dimension N for signals x in R^N, and the underlying distribution is unknown. In this severely…
Many real-world systems of coupled agents exhibit directed interactions, meaning that the influence of an agent on another is not reciprocal. Furthermore, interactions usually do not have identical amplitude and/or sign. To describe…
Synchronisation of coupled oscillators is a ubiquitous phenomenon, occurring in topics ranging from biology and physics, to social networks and technology. A fundamental and long-time goal in the study of synchronisation has been to find…
Aiming at the core problem that it is difficult for a fixed inertia coefficient to balance transient disturbance suppression and long-term stability in complex network synchronization systems, an adaptive inertia control strategy based on…
In this work, a novel approach for the reliable and efficient numerical integration of the Kuramoto model on graphs is studied. For this purpose, the notion of order parameters is revisited for the classical Kuramoto model describing…
We study the dynamics involved in a sparse random network model. We extend the standard mean-field approximation for the dynamics of a random network by employing the path-integral approach. The result indicates that the distribution of the…
In recent years, hardware implementations of Ising machines have emerged as a viable alternative to quantum computing for solving hard optimization problems among other applications. Unlike quantum hardware, dense connectivity can be…
Graph matching is a challenging problem with very important applications in a wide range of fields, from image and video analysis to biological and biomedical problems. We propose a robust graph matching algorithm inspired in…
Synchronization of an ensemble of oscillators is an emergent phenomenon present in several complex systems, ranging from social and physical to biological and technological systems. The most successful approach to describe how coherent…
In this letter, we propose an algorithm for learning a sparse weighted graph by estimating its adjacency matrix under the assumption that the observed signals vary smoothly over the nodes of the graph. The proposed algorithm is based on the…