Indexed metadata

Random 33-regular graphs are not globally synchronizing

Ciro Carvallo, Pablo Groisman, Dieter Mitsche

Source record

Source: arXiv

Published: Oct 6, 2026

arXiv: 2610.09135

Open original source ↗

Source abstract

We study the homogeneous Kuramoto model on random 3-regular graphs. A connected graph GG is globally synchronizing if, for almost every initial condition, the gradient flow converges to a fully synchronized state, in which all phases coincide. It has been conjectured by Bandeira [Oberwolfach Rep. 21 (2024) 1163-1226] that a random 3-regular graph G2n,3G_{2n,3} is globally synchronizing with high probability. We disprove this conjecture in a strong way: G2n,3G_{2n,3} is not globally synchronizing with probability tending to 1.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Random $3$-regular graphs are not globally synchronizing — Mathematical Frontier Network