Metraipolis › archive › dc_3cf787afc9cd

Distributed Optimization over Simplicial Complexes via Topological Dirac Synchronization — arXiv:2610.22628

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22628
License (as archived)
CC0-1.0
Archived
2026-10-19T09:37:44.608Z
SHA-256 of the archived text
e6a561fccbf48af6805bef1c7e1f85c9464d5ed4656cd6600b9d83ff87cf01b6
Stable URL of this page
https://metraipolis.com/documento/dc_3cf787afc9cd

How to cite

Distributed Optimization over Simplicial Complexes via Topological Dirac Synchronization — arXiv:2610.22628 — arXiv (en), https://arxiv.org/abs/2610.22628 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3cf787afc9cd (Metraipolis archive dc_3cf787afc9cd, sha256 e6a561fccbf48af6805bef1c7e1f85c9464d5ed4656cd6600b9d83ff87cf01b6)
BibTeX
@misc{dc3cf787afc9cd,
  title = {Distributed Optimization over Simplicial Complexes via Topological Dirac Synchronization — arXiv:2610.22628},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22628},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3cf787afc9cd; sha256 e6a561fccbf48af6805bef1c7e1f85c9464d5ed4656cd6600b9d83ff87cf01b6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22628. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce a distributed optimization framework for systems with higher-order interactions represented by simplicial and cell complexes. Specializing global topological Dirac synchronization to gradient flows of strongly convex local objectives, we show that the synchronized equilibrium coincides with the minimizer of the aggregate cost, without Lagrange multipliers, dual variables, or saddle-point dynamics. Orientation-equivariant convex terms and cell-dependent dimensional targets allow the optimal state to be nonzero, as determined by joint per-dimension optimality conditions. Our algorithm couples signals across dimensions through the Dirac operator: nodes interact with edges, edges with nodes and faces, and faces with edges, enabling information exchange beyond graph-Laplacian methods. In the isotropic case, a Master Stability Function analysis yields a necessary and sufficient condition for local exponential stability: the product of the directional coupling strengths must be below the squared ratio of the strong convexity parameter to the spectral radius of the complex. A weighted Lyapunov argument accounting for non-normal Dirac coupling establishes global exponential convergence at the same rate. Finally, we identify a topological admissibility condition ensuring invariance of the synchronization manifold and coherent convergence of cells to the optimum, with no counterpart in classical graph-based distributed optimization.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.22628 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:33:44.730Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).