Guarantees for Spontaneous Synchronization on Random Geometric Graphs

DOI10.1137/23m1559270arXiv2208.12246MaRDI QIDQ6196197

Pedro Abdalla, Afonso S. Bandeira, Unnamed Author

Publication date: 14 March 2024

Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.12246

zbMATH Keywords

dynamical systemsrandom graphscomplex networksKuramoto

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

• Unnamed Item
• Unnamed Item
• High-dimensional random geometric graphs and their clique number
• Synchronization in complex networks of phase oscillators: a survey
• The Kuramoto model in complex networks
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Phase transitions for detecting latent geometry in random graphs
• Local minima and convergence in low-rank semidefinite programming
• Testing for high-dimensional geometry in random graphs
• Nonconvex Phase Synchronization
• There is no non-zero stable fixed point for dense networks in the homogeneous Kuramoto model
• Random Geometric Graphs
• Deterministic and randomized polynomial‐time approximation of radii
• The Expected Norm of Random Matrices
• High-Dimensional Probability
• Sufficiently dense Kuramoto networks are globally synchronizing
• Synchronization in complex oscillator networks and smart grids
• On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization

This page was built for publication: Guarantees for Spontaneous Synchronization on Random Geometric Graphs