The random graph process is globally synchronizing

DOI10.1112/BLMS.70226MaRDI QIDQ6864330zbMATH OpenFDO

Authors Vishesh Jain, Clayton M. Mizgerd, Mehtaab Sawhney

Publication date 4 February 2026

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1112/BLMS.70226

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Nonlinear oscillations and coupled oscillators for ordinary differential equations (34C15) Synchronization of solutions to ordinary differential equations (34D06)

Cites work

• scientific article; zbMATH DE number 3524004 (Why is no real title available?)
• Asymptotics for Shamir's problem
• On the landscape of synchronization networks: a perspective from nonconvex optimization
• Perfect fractional matchings in \(k\)-out hypergraphs
• Sufficiently dense Kuramoto networks are globally synchronizing

Cited in

(1)

• Expander graphs are globally synchronizing

This page was built for publication: The random graph process is globally synchronizing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864330)