paper

Graphs with connectivity are globally synchronizing

arXiv:2608.20010

Abstract

We study synchronization in the Kuramoto model on finite graphs. We prove that there is an absolute constant such that every finite simple graph on vertices with minimum degree at least has no local minima of the Kuramoto energy other than the fully synchronized states. This strictly improves the previous upper bound and refutes a conjecture of Bandeira, Kireeva, Maillard, and Rödder.

17 pages

Graphs with connectivity $3/4 - \varepsilon$ are globally synchronizing · wovepaper