Abstract:We study the homogeneous Kuramoto model on a graph and the associated nonconvex optimization problem $\min_{\boldsymbol{\theta}\in\mathbb{R}^n}-\frac12\sum_{1\leq i,j\leq n}A_{ij}\cos(\theta_i-\theta_j)$. The objective defines an energy over configurations of points on the unit circle and serves as a Lyapunov potential for the dynamics. We prove that every connected quasi-threshold graph is second-order globally synchronizing: every second-order stationary point is a global minimizer corresponding to full synchronization. Consequently, the dynamics converge to full synchronization from almost every initial condition. These graphs are precisely the comparability graphs of partially ordered sets induced by rooted trees. Viewing these trees as graph skeletons, we establish an upward propagation mechanism: synchronization within each child subtree forces the parent and all its descendants to synchronize. The argument proceeds from the leaves to the root and relies on phasor geometry and second-order optimality conditions. Our result provides a structural route to global synchronization that complements existing results based on minimum-degree or spectral proximity to complete graphs.
From: Hongjin Wu [view email]
[v1]
Fri, 26 Dec 2025 09:20:12 UTC (292 KB)
[v2]
Sat, 2 May 2026 10:20:15 UTC (200 KB)
[v3]
Sun, 6 Sep 2026 21:38:32 UTC (46 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。