REVIEW 3 cited by
The random graph process is globally synchronizing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
The homogeneous Kuramoto model on a graph $G = (V,E)$ is a network of $|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph $G$ is said to be globally synchronizing if, for almost every initial condition, the homogeneous Kuramoto model converges to the all-in-phase synchronous state. Confirming a conjecture of Abdalla, Bandeira, Kassabov, Souza, Strogatz, and Townsend, we show that with high probability, the random graph process becomes globally synchronizing as soon as it is connected. This is best possible, since connectivity is a necessary condition for global synchronization.
Forward citations
Cited by 3 Pith papers
-
Spectra of high-dimensional sparse random geometric graphs
Under mild dimension conditions, the empirical spectral distribution of sparse high-dimensional random geometric graphs matches the semicircle law or the Erdős-Renyi limit.
-
Synchronization of mean-field models on the circle
A new criterion based on the L1 norm of the third derivative of the interaction function establishes global synchronization for circle mean-field models, resolving the self-attention synchronization question for β ≥ -0.16.
-
Critical attention scaling in long-context transformers
In a simplified attention model with normalized tokens, the phase boundary between token collapse and identity attention occurs when the attention-temperature scaling factor β_n is of order log n, with constant 1/(1−ρ).
Discussion (0). Continue with ORCID to comment.