The lower bound of the network connectivity guaranteeing in-phase synchronization

DOI10.1063/5.0054271zbMATH Open1465.34052arXiv2104.05954OpenAlexW3166934385MaRDI QIDQ5000869FDOQ5000869

Ryosuke Yoneda, Tsuyoshi Tatsukawa, Jun-nosuke Teramae

Publication date: 15 July 2021

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Abstract: In-phase synchronization is a stable state of identical Kuramoto oscillators coupled on a network with identical positive connections, regardless of network topology. However, this fact does not mean that the networks always synchronize in-phase because other attractors besides the stable state may exist. The critical connectivity $m{u}_{mathrmc}$ is defined as the network connectivity above which only the in-phase state is stable for all the networks. In other words, below $m{u}_{mathrmc}$, one can find at least one network which has a stable state besides the in-phase sync. The best known evaluation of the value so far is $0.6828cdotsleqm{u}_{mathrmc}leq0.75$. In this paper, focusing on the twisted states of the circulant networks, we provide a method to systematically analyze the linear stability of all possible twisted states on all possible circulant networks. This method using integer programming enables us to find the densest circulant network having a stable twisted state besides the in-phase sync, which breaks a record of the lower bound of the $m{u}_{mathrmc}$ from $0.6828cdots$ to $0.6838cdots$. We confirm the validity of the theory by numerical simulations of the networks not converging to the in-phase state.

Full work available at URL: https://arxiv.org/abs/2104.05954

Recommendations

• scientific article; zbMATH DE number 4050994
• Network synchronization: optimal and pessimal scale-free topologies
• Network synchronization with convexity
• Guaranteeing global synchronization in networks with stochastic interactions
• On the Complexity of Network Synchronization
• Algorithms and Computation
• Synchronization modulo \(P\) in dynamic networks
• Guaranteed cost synchronization of complex network systems with delay
• Cooperative Network Synchronization: Asymptotic Analysis
• Near-optimal bounds for phase synchronization

Mathematics Subject Classification ID

Qualitative investigation and simulation of ordinary differential equation models (34C60) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Synchronization of solutions to ordinary differential equations (34D06)

Cites Work

• Julia: A Fresh Approach to Numerical Computing
• JuMP: A Modeling Language for Mathematical Optimization
• Title not available (Why is that?)
• Low dimensional behavior of large systems of globally coupled oscillators
• A proof of the Kuramoto conjecture for a bifurcation structure of the infinite-dimensional Kuramoto model
• Constants of motion for superconducting Josephson arrays
• The size of the sync basin
• An introduction to Morse theory. Transl. from the Japanese by Kiki Hudson and Masahico Saito
• There is no non-zero stable fixed point for dense networks in the homogeneous Kuramoto model
• Integer Programming
• The Kuramoto model revisited
• Synchronization of Kuramoto oscillators in dense networks
• Bifurctions, patterns and symmetry. Selected papers dedicated to the memory of John David Crawford
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• Dense networks that do not synchronize and sparse ones that do
• Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization

Cited In (7)

• The Kuramoto model on dynamic random graphs
• Equilibria in Kuramoto Oscillator Networks: An Algebraic Approach
• Completely degenerate equilibria of the Kuramoto model on networks
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• Kuramoto Networks with Infinitely Many Stable Equilibria
• Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
• DenseSync

Uses Software

• Julia
• JuMP
• GitHub

This page was built for publication: The lower bound of the network connectivity guaranteeing in-phase synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000869)