12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Fully Asynchronous Push-Sum With Growing Intercommunication Intervals

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          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.

          Related collections

          Most cited references3

          • Record: found
          • Abstract: not found
          • Article: not found

          Average Consensus in the Presence of Delays in Directed Graph Topologies

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Robust Distributed Average Consensus via Exchange of Running Sums

                Bookmark

                Author and article information

                Journal
                23 February 2018
                Article
                1802.08634
                5616c55a-0c43-42f9-9c0d-7937c552b504

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                math.OC

                Comments

                Comment on this article