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

DOI10.1063/5.0054271MaRDI QIDQ5000869zbMATH OpenOpenAlexFDO

Authors 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)

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

Mathematics Subject Classification ID

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

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.

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

Cites work

• A proof of the Kuramoto conjecture for a bifurcation structure of the infinite-dimensional Kuramoto model
• An introduction to Morse theory. Transl. from the Japanese by Kiki Hudson and Masahico Saito
• Bifurctions, patterns and symmetry. Selected papers dedicated to the memory of John David Crawford
• Constants of motion for superconducting Josephson arrays
• 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
• scientific article; zbMATH DE number 3524004 (Why is no real title available?)
• Integer Programming
• Julia: a fresh approach to numerical computing
• JuMP: a modeling language for mathematical optimization
• Low dimensional behavior of large systems of globally coupled oscillators
• On the landscape of synchronization networks: a perspective from nonconvex optimization
• Synchronization of Kuramoto oscillators in dense networks
• The Kuramoto model revisited
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• The size of the sync basin
• There is no non-zero stable fixed point for dense networks in the homogeneous Kuramoto model

Cited in

(11)

• DenseSync
• The lower bound of the network connectivity guaranteeing in-phase synchronization
• Sufficiently dense Kuramoto networks are globally synchronizing
• Dense networks that do not synchronize and sparse ones that do
• The Kuramoto model on dynamic random graphs
• Equilibria in Kuramoto Oscillator Networks: An Algebraic Approach
• Kuramoto Networks with Infinitely Many Stable Equilibria
• Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
• Completely degenerate equilibria of the Kuramoto model on networks
• Expander graphs are globally synchronizing
• Synchronization on circles and spheres with nonlinear interactions

Describes a project that uses

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)