English

Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

Optimization and Control 2018-02-26 v1

Abstract

We propose an algorithm for average consensus over a directed graph which is both fully asynchronous and robust to unreliable communications. We show its convergence to the average, while allowing for slowly growing but potentially unbounded communication failures.

Keywords

Cite

@article{arxiv.1802.08634,
  title  = {Fully Asynchronous Push-Sum With Growing Intercommunication Intervals},
  author = {Alex Olshevsky and Ioannis Ch. Paschalidis and Artin Spiridonoff},
  journal= {arXiv preprint arXiv:1802.08634},
  year   = {2018}
}
R2 v1 2026-06-23T00:31:40.718Z