Capturing the critical coupling of large random Kuramoto networks with graphons
arXiv:2503.01589 · doi:10.1007/s00332-025-10210-2
Abstract
Collective oscillations and patterns of synchrony have long fascinated researchers in the applied sciences, particularly due to their far-reaching importance in chemistry, physics, and biology. The Kuramoto model has emerged as a prototypical mathematical equation to understand synchronization in coupled oscillators, allowing one to study the effect of different frequency distributions and connection networks between oscillators. In this work we provide a framework for determining both the emergence and the persistence of synchronous solutions to Kuramoto models on large random networks and with random frequencies. This is achieved by appealing the theory of graphons to analyze a continuum model coming in the form of an infinite oscillator limit which provides a single master equation for studying random Kuramoto models. We show that bifurcations to synchrony and hyperbolic synchrony patterns in the continuum model can also be found in related random Kuramoto networks for large numbers of oscillators. We further provide a detailed application of our results to oscillators arranged on Erdős--Rényi random networks, for which we further identify that not all bifurcations to synchrony emerge through simple co-dimension one bifurcations. Finally, the method of proof can be applied to interacting particle systems beyond the Kuramoto model to establish the persistence of saddle-node bifurcations.
References in corpus (8)
- User-friendly tail bounds for sums of random matrices
- The nonlinear heat equation on W-random graphs
- Graphon Mean Field Games and the GMFG Equations
- Graphon Control of Large-scale Networks of Linear Systems
- Mean-field and graph limits for collective dynamics models with time-varying weights
- Stability of twisted states in the continuum Kuramoto model
- Phase Oscillator Networks with Nonlocal Higher-Order Interactions: Twisted States, Stability and Bifurcations
- Pattern Formation in Random Networks Using Graphons