Capturing the critical coupling of large random Kuramoto networks with graphons
Jason Bramburger, Matt Holzer
TL;DR
This work develops a graphon-based mean-field framework to study synchronization in large random Kuramoto networks with random frequencies. It identifies a master nonlocal graphon equation F(u,Ω,K)=0 that governs existence and stability of synchronous states in the infinite-network limit and informs persistence to finite networks. For Erdős–Rényi networks, the onset of synchrony can arise either through co-dimension one saddle-node bifurcations or via bifurcations from the essential spectrum, depending on the frequency distribution. Center-manifold reductions for both the graphon and step-graphon problems yield reduced scalar dynamics with explicit coefficients that determine the bifurcation type and guarantee convergence K_{crit,n}→K_{crit} as n→∞. Overall, the framework links infinite-network graphon limits with finite random networks, enabling precise predictions of synchronization thresholds across network sizes.
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 mean-field 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 mean-field 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.
