arXiv (All)
open access
Benign nonconvexity of synchronization landscape induced by graph skeletons
We study the homogeneous Kuramoto model on a graph and the associated nonconvex optimization problem $\min_{\boldsymbolθ\in\mathbb{R}^n}-\frac12\sum_{1\leq i,j\leq n}A_{ij}\cos(θ_i-θ_j)$. The objective defines an energy over configurations of points on the unit circle and serves as a Lyapunov potent
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Dynamic Stability Landscapes in Synchronization Networks#222594
- Port-Hamiltonian Neural Networks for Systems with Multiple Asymptotically Stable Equilibria#1156628
- Improved Finite-Time Lyapunov Exponent framework for Comprehensive Synchronization Analysis in Multilayer Networks#1144164
- Splitting Methods for Nonconvex Optimisation: Convergence and Saddle Point Avoidance Through Shadow Sequences#1142597
- Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks#19023
Record · ID 974285
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive