Metraipolis › archive › dc_4e0ecbc71c20

Topology Design for Distributed Consensus with Relay-Assisted Communication — arXiv:2610.08489

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08489
License (as archived)
CC0-1.0
Archived
2026-10-07T11:49:27.428Z
SHA-256 of the archived text
068e6e735821c064d2663b36c512ef5aaff61fef2d8e158c550b66d3eecb00ac
Stable URL of this page
https://metraipolis.com/documento/dc_4e0ecbc71c20

How to cite

Topology Design for Distributed Consensus with Relay-Assisted Communication — arXiv:2610.08489 — arXiv (en), https://arxiv.org/abs/2610.08489 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4e0ecbc71c20 (Metraipolis archive dc_4e0ecbc71c20, sha256 068e6e735821c064d2663b36c512ef5aaff61fef2d8e158c550b66d3eecb00ac)
BibTeX
@misc{dc4e0ecbc71c20,
  title = {Topology Design for Distributed Consensus with Relay-Assisted Communication — arXiv:2610.08489},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08489},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4e0ecbc71c20; sha256 068e6e735821c064d2663b36c512ef5aaff61fef2d8e158c550b66d3eecb00ac},
  year = {2026}
}

Archived text

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

This paper focuses on relay-assisted topology optimization to accelerate the convergence of distributed consensus algorithms over weakly connected networks. Instead of permanently adding a fixed set of relay links, we introduce a time-sharing framework where multiple relay configurations are activated in a probabilistic manner. An ActiveSet-based algorithm incrementally constructs candidate relay edge sets and jointly optimizes the mixing matrices and the associated relay set activation probabilities, allowing adaptive relay selection in the optimization process. Simulation results demonstrate a substantially improved performance-cost trade-off compared with fixed-cardinality relay selection strategies.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.08489 — 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-07T11:21:09.864Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).