ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a graph be globally synchronizing when its adjacency matrix is globally synchronizing, meaning that the only local minima of the Kuramoto energy are the global synchronized minima. Global synchronization conjecture. A uniformly random 33-regular graph is globally synchronizing with high probability, meaning with probability tending to 11 as n→∞n\to\infty. Uniform random dd-regular graphs are known to be globally synchronizing with high probability for d≥600d\geq600, whereas the 33-regular case remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.