Expander graphs are globally synchronizing

Abstract

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 that a graph with sufficient expansion must be globally synchronizing, meaning that a homogeneous Kuramoto model of identical oscillators on such a graph will converge to the fully synchronized state with all the oscillators having the same phase, for every initial state up to a set of measure zero. In particular, we show that for any $\epsilon >0$ and $p\ge (1+\epsilon )(\log n)/n$, the homogeneous Kuramoto model on the Erdős-Rényi random graph $G(n,p)$ is globally synchronizing with probability tending to one as $n$ goes to infinity. This improves on a previous result of Kassabov, Strogatz, and Townsend and solves a conjecture of Ling, Xu, and Bandeira. We also show that the model is globally synchronizing on any $d$-regular Ramanujan graph, and on typical $d$-regular graphs, for large enough degree $d$.

35 pages, 3 figures

References in corpus (10)

• Synchronization in complex networks
• The Kuramoto model in complex networks
• Understanding the dynamics of biological and neural oscillator networks through exact mean-field reductions: a review
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• There are no non-zero Stable Fixed Points for dense networks in the homogeneous Kuramoto model
• Synchronization in Random Geometric Graphs
• A global synchronization theorem for oscillators on a random graph
• Sufficiently dense Kuramoto networks are globally synchronizing
• Synchronization of Kuramoto Oscillators in Dense Networks
• The lower bound of the network connectivity guaranteeing in-phase synchronization

Cited by in corpus (2)

• Quantum-like states on complex synchronized networks
• Dynamics in an emergent quantum-like state space generated by a nonlinear classical network