Related papers: From weighted to unweighted graphs in Synchronizin…
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…
The Kuramoto model is a classical mathematical model in the field of non-linear dynamical systems that describes the evolution of coupled oscillators in a network that may reach a synchronous state. The relationship between the network's…
We prove that the Kuramoto model on a graph can contain infinitely many non-equivalent stable equilibria. More precisely, we prove that for every positive integer d there is a connected graph such that the set of stable equilibria contains…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
The Kuramoto model can be formulated as a gradient flow on a nonconvex energy landscape of the form $E(\boldsymbol{\theta}) := \frac{1}{2} \sum_{1\le i,j\le n} A_{ij}\bigl(1-\cos(\theta_i-\theta_j)\bigr).$ A fundamental question is to…
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…
In his classical work, Kuramoto analytically described the onset of synchronization in all-to-all coupled networks of phase oscillators with random intrinsic frequencies. Specifically, he identified a critical value of the coupling…
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…
The homogeneous Kuramoto model on a graph $G = (V,E)$ is a network of $|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph $G$ is said…
An interesting problem in synchronization is the study of coupled oscillators, wherein oscillators with different natural frequencies synchronize to a common frequency and equilibrium phase difference. In this paper, we investigate the…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
We propose new mathematical optimization models for generating sparse dynamical graphs, or networks, that can achieve synchronization. The synchronization phenomenon is studied using the Kuramoto model, defined in terms of the adjacency…
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a…
We study synchronization properties of systems of Kuramoto oscillators. The problem can also be understood as a question about the properties of an energy landscape created by a graph. More formally, let $G=(V,E)$ be a connected graph and…
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…
We discuss the aspects of synchronization on inhomogeneous star-like graphs with long rays in Kuramoto model framework. We assume the positive correlation between internal frequencies and degrees for all nodes which supports the abrupt…
The Kuramoto model is fundamental to the study of synchronization. It consists of a collection of oscillators with interactions given by a network, which we identify respectively with vertices and edges of a graph. In this paper, we show…
Synchronization in systems of coupled Kuramoto oscillators may depend on their natural frequencies, coupling, and underlying networks. In this paper, we reduce the alternatives to only one by considering identical oscillators where the only…
Synchronization is crucial for the correct functionality 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…