2000 character limit reached
Graphs with connectivity are globally synchronizing
Published 20 Aug 2026 in math.CO and math.DS | (2608.20010v1)
Abstract: We study synchronization in the Kuramoto model on finite graphs. We prove that there is an absolute constant $η>0$ 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 $3/4$ upper bound and refutes a conjecture of Bandeira, Kireeva, Maillard, and Rödder.
Paper Prompts
Sign up for free to create and run prompts on this paper.