A global synchronization theorem for oscillators on a random graph

DOI10.1063/5.0090443MaRDI QIDQ6392971zbMATH OpenWikidataFDO

Authors Martin Kassabov, Steven Strogatz, Alex Townsend

Publication date 7 March 2022

Full work available at URL https://doi.org/10.1063/5.0090443

Abstract: Consider $n$ identical Kuramoto oscillators on a random graph. Specifically, consider ER random graphs in which any two oscillators are bidirectionally coupled with unit strength, independently and at random, with probability $0leqpleq1$. We say that a network is globally synchronizing if the oscillators converge to the all-in-phase synchronous state for almost all initial conditions. Is there a critical threshold for $p$ above which global synchrony is extremely likely but below which it is extremely rare? It is suspected that a critical threshold exists and is close to the so-called connectivity threshold, namely, $psimlog(n)/n$ for $ngg1$. Ling, Xu, and Bandeira made the first progress toward proving a result in this direction: they showed that if $pgglog(n)/n^{1/3}$, then ER networks of Kuramoto oscillators are globally synchronizing with high probability as $nightarrowinfty$. Here we improve that result by showing that $pgglo{g}^2(n)/n$ suffices. Our estimates are explicit: for example, we can say that there is more than a $99.9996\mathrm{\%}$ chance that a random network with $n=10^6$ and $p>0.01117$ is globally synchronizing.

This page was built for publication: A global synchronization theorem for oscillators on a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6392971)