The conjecture on globally synchronizing random 3-regular graphs
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 -regular graph is globally synchronizing with high probability, meaning with probability tending to as . Uniform random -regular graphs are known to be globally synchronizing with high probability for , whereas the -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.