Search arXivSearch

arXiv · 1707.00713

Hyperbolic Geometry of Kuramoto Oscillator Networks

Abstract

Kuramoto oscillator networks have the special property that their trajectories are constrained to lie on the (at most) 3D orbits of the Möbius group acting on the state space $T^N$ (the $N$-fold torus). This result has been used to explain the existence of the $N-3$ constants of motion discovered by Watanabe and Strogatz for Kuramoto oscillator networks. In this work we investigate geometric consequences of this Möbius group action. The dynamics of Kuramoto phase models can be further reduced to 2D reduced group orbits, which have a natural geometry equivalent to the unit disk $Δ$ with the hyperbolic metric. We show that in this metric the original Kuramoto phase model (with order parameter $Z_1$ equal to the centroid of the oscillator configuration of points on the unit circle) is a gradient flow and the model with order parameter $iZ_1$ (corresponding to cosine phase coupling) is a completely integrable Hamiltonian flow. We give necessary and sufficient conditions for general Kuramoto phase models to be gradient or Hamiltonian flows in this metric. This allows us to identify several new infinite families of hyperbolic gradient or Hamiltonian Kuramoto oscillator networks which therefore have simple dynamics with respect to this geometry. We prove that for the $Z_1$ model, a generic 2D reduced group orbit has a unique fixed point corresponding to the hyperbolic barycenter of the oscillator configuration, and therefore the dynamics are equivalent on different generic reduced group orbits. This is not always the case for more general hyperbolic gradient or Hamiltonian flows; the reduced group orbits may have multiple fixed points, which also may bifurcate as the reduced group orbits vary.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bolun Chen, Jan R. Engelbrecht, Renato Mirollo. 2017-07-03. Hyperbolic Geometry of Kuramoto Oscillator Networks. https://doi.org/10.1088/1751-8121%2Faa7e39

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Self-Organization to the Edge of Ergodicity Breaking in a Complex Adaptive System

Self-organized criticality is widely invoked for collective behavior, yet its role in objective-driven, heterogeneous adaptive systems is unclear. We introduce {\tt EvoSK}: agents learn on a Sherrington--Kirkpatrick landscape while the least fit are replaced. It self-organizes to the edge of ergodicity breaking, with scale-free avalanches ($τ\approx -1.5$) and rewards beating any tuned non-evolutionary regime. Its cascade's branching ratio is the spectral radius of the learning dynamics' Jacobian, making critical branching and ergodicity breaking one marginal-stability condition fixing the exponent. The attraction to criticality follows from the selection--mutation balance: subcritical cascades decay too fast to dislodge frozen agents, supercritical cascades shield them from selection; only the critical power-law tail supplies the polynomial rate the balance requires.

nlin.AO

When higher-order interactions enhance synchronization: the case of the Kuramoto model

Synchronization is a fundamental phenomenon in complex systems, observed across a wide range of natural and engineered contexts. The Kuramoto model provides a foundational framework for understanding synchronization among coupled oscillators, traditionally assuming pairwise interactions. However, many real-world systems exhibit group and many-body interactions, which can be effectively modeled through hypergraphs. Here we show that the effect of such higher-order interactions on synchronization is non-monotonic. Through a numerical study of higher-order Kuramoto models on random hypergraphs and on globally coupled systems, we find that the degree of synchronization reached from incoherent initial conditions is maximized at a small but nonzero higher-order coupling strength: weak higher-order interactions enhance synchronization when added to pairwise ones, whereas strong ones work against it, in line with earlier reports of reduced basins and of cluster states. We further show, through a cost-constrained allocation analysis, that under a constrained budget for interactions a mixed allocation of pairwise and higher-order couplings consistently achieves higher synchronization than relying on either type alone. These findings clarify the role of higher-order interactions in shaping collective dynamics and point to design principles for optimizing synchronization in complex systems.

nlin.AO

Dynamics-preserving network reductions for ride-pooling paths

Reducing the complexity of ride-pooling paths is a central challenge in systems with distributed demand. Here we show that such dynamics admit an exact coarse-grained representation: for a broad class of routing algorithms whose decisions depend only on path lengths, the full network can be reduced to an effective network of active nodes weighted by shortest-path distances without altering the resulting trajectories, up to stochastic degeneracy breaking. The reduction therefore defines an equivalence class of network representations generating identical path dynamics. We further demonstrate that for globally optimizing dispatchers this equivalence is systematically violated through degeneracy amplification, yet remains quantitatively accurate beyond the exactly solvable regime. Our results identify when spatial structure can be integrated out without loss of dynamical fidelity, providing a general framework for the analysis of interacting path processes.

nlin.AO