Papers
Topics
Authors
Recent
Search
2000 character limit reached

Beyond 11/16: dense Kuramoto networks that resist synchrony

Published 15 Oct 2026 in nlin.AO, math.CO, and math.DS | (2610.21271v1)

Abstract: How densely must a network of identical Kuramoto oscillators be wired before synchrony is its only stable state? The answer is a critical connectivity μcμ_c (the minimum degree divided by n−1n-1), known to satisfy $11/16\leμ_c&lt;3/4$. We raise the lower bound from $11/16=0.6875$ to μc≥(4+2q<sup><em>)/(7+q</em>)=0.6929077…μ_c\ge(4+2q<sup><em>)/(7+q^</em>)=0.6929077\ldots, where q<sup>∗≈0.6506q<sup>*\approx0.6506 is a root of an explicit polynomial of degree 8. The networks approaching this bound carry stable states that hug the four-cluster state: three neighboring clusters each split into two slightly separated halves, and the four crossed links between neighboring halves (those whose phase gap deviates most from a quarter turn) have densities approaching q<sup>∗q<sup>*. We build these networks from a coarse-grained cluster model, verify stability with interval arithmetic, and blow the model up into large networks with an exact minimum degree. The states are fragile and easily missed by numerical searches that impose stability margins.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.