Related papers: A global synchronization theorem for oscillators o…
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…
The global clustering coefficient serves as a powerful metric for the structural analysis and comparison of complex networks. Random geometric graphs offer a realistic framework for representing the spatial constraints and geometry often…
A graph is said to be $\mathcal{H}(n, \Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. Using a `matching-based' embedding technique introduced by Alon and F\"uredi, Dellamonica, Kohayakawa,…
We study the frequency-synchronization of randomly coupled oscillators. By analyzing the continuum limit, we obtain the sufficient condition for the mean-field type synchronization. We especially find that the critical coupling constant $K$…
A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…
Motivated by recent interest for multi-agent systems and smart power grid architectures, we discuss the synchronization problem for the network-reduced model of a power system with non-trivial transfer conductances. Our key insight is to…
We consider $N$ oscillators coupled by a mean field as in the Winfree model. The model is governed by two parameters: the coupling strength $\kappa$ and the spectrum width $\gamma$ of the frequencies of each oscillator. In the uncoupled…
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…
In this paper we study the synchronization properties of random geometric graphs. We show that the onset of synchronization takes place roughly at the same value of the order parameter that a random graph with the same size and average…
Spontaneous synchronization is a remarkable collective effect observed in nature, whereby a population of oscillating units, which have diverse natural frequencies and are in weak interaction with one another, evolves to spontaneously…
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…
In this article we study synchronization of Kuramoto oscillators with heterogeneous frequencies, and where underlying topology is a graph of diameter two. When the coupling strengths between every two connected oscillators are the same, we…
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 analyze the interplay of synchronization and structure evolution in an evolving network of phase oscillators. An initially random network is adaptively rewired according to the dynamical coherence of the oscillators, in order to enhance…
We study the global synchronization of hierarchically-organized Stuart-Landau oscillators, where each subsystem consists of three oscillators with activity-dependent couplings. We consider all possible coupling signs between the three…
The emergence of explosive synchronization has been reported as an abrupt transition in complex networks of first-order Kuramoto oscillators. In this Letter, we demonstrate that the nodes in a second-order Kuramoto model, perform a cascade…
The celebrated theorem of Chung, Graham, and Wilson on quasirandom graphs implies that if the 4-cycle and edge counts in a graph $G$ are both close to their typical number in $\mathbb{G}(n,1/2),$ then this also holds for the counts of…
In a random key graph (RKG) of $n$ nodes each node is randomly assigned a key ring of $K_n$ cryptographic keys from a pool of $P_n$ keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume…
A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such…
Synchronization underlies phenomena including memory and perception in the brain, coordinated motion of animal flocks, and stability of the power grid. These synchronization phenomena are often modeled through networks of phase-coupled…