Phase Synchronization in Random Geometric Graphs on the 2D Sphere

The Kuramoto model is a classical nonlinear ODE system designed to study synchronization phenomena. Each equation represents the phase of an oscillator and the coupling between them is determined by a graph. There is an increasing interest in understanding the relation between the graph topology and the spontaneous synchronization of the oscillators. Abdalla, Bandeira and Invernizzi considered random geometric graphs on the $d$-dimensional sphere and proved that the system synchronizes with high probability as long as the mean number of neighbors and the dimension $d$ go to infinity. They posed the question about the behavior when $d$ is small. In this paper, we prove that synchronization holds for random geometric graphs on the two-dimensional sphere, with high probability as the number of nodes goes to infinity, as long as the initial conditions converge to a smooth function. We conjecture a similar behavior for more general simply-connected closed Riemannian manifolds but we expect global synchronization to fail if the manifold is not simply-connected, as was shown in [11] and suggested in [9].

Publication Details

Journal
ArXiv.org
Published
2025-04-01
Primary Topic
Nonlinear Dynamics and Pattern Formation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Phase Synchronization in Random Geometric Graphs on the 2D Sphere

ArXiv.org
Nonlinear Dynamics and Pattern Formation
article

Phase Synchronization in Random Geometric Graphs on the 2D Sphere

article en

Abstract

The Kuramoto model is a classical nonlinear ODE system designed to study synchronization phenomena. Each equation represents the phase of an oscillator and the coupling between them is determined by a graph. There is an increasing interest in understanding the relation between the graph topology and the spontaneous synchronization of the oscillators. Abdalla, Bandeira and Invernizzi considered random geometric graphs on the $d$-dimensional sphere and proved that the system synchronizes with high probability as long as the mean number of neighbors and the dimension $d$ go to infinity. They posed the question about the behavior when $d$ is small. In this paper, we prove that synchronization holds for random geometric graphs on the two-dimensional sphere, with high probability as the number of nodes goes to infinity, as long as the initial conditions converge to a smooth function. We conjecture a similar behavior for more general simply-connected closed Riemannian manifolds but we expect global synchronization to fail if the manifold is not simply-connected, as was shown in [11] and suggested in [9].

ArXiv.org
Openalex Percentile: Top 46%
Nonlinear Dynamics and Pattern Formation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Phase Synchronization in Random Geometric Graphs on the 2D Sphere · ArXiv.org (2025) | TGRS Research Map | TGRS