Papers › The lower bound of the network connectivity guaranteeing in-phase synchronization
The lower bound of the network connectivity guaranteeing in-phase synchronization
Ryosuke Yoneda, Tsuyoshi Tatsukawa, Jun-nosuke Teramae
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In-phase synchronization is a stable state of identical Kuramoto oscillators coupled on a network with identical positive connections, regardless of network topology. However, this fact does not mean that the networks always synchronize in-phase because other attractors besides the stable state may exist. The critical connectivity μ_c is defined as the network connectivity above which only the in-phase state is stable for all the networks. In other words, below μ_c, one can find at least one network which has a stable state besides the in-phase sync. The best known evaluation of the value so far is 0.6828⋯≤μ_c≤0.75. In this paper, focusing on the twisted states of the circulant networks, we provide a method to systematically analyze the linear stability of all possible twisted states on all possible circulant networks. This method using integer programming enables us to find the densest circulant network having a stable twisted state besides the in-phase sync, which breaks a record of the lower bound of the μ_c from 0.6828⋯ to 0.6838⋯. We confirm the validity of the theory by numerical simulations of the networks not converging to the in-phase state.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections