Push-sum on random graphs
From MaRDI portal
Publication:6289718
DOI10.1109/TAC.2019.2929206zbMATH Open1533.93731arXiv1708.00915WikidataQ127463177 ScholiaQ127463177MaRDI QIDQ6289718FDOQ6289718
Authors: Pouya Rezaienia, Bahman Gharesifard, Tamás Linder, Behrouz Touri 
Publication date: 2 August 2017
Abstract: In this paper, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push-sum algorithms to such random scenarios. Provided that an ergodicity notion, which we term the directed infinite flow property, holds and the auxiliary states of agents are uniformly bounded away from zero infinitely often, we prove the almost sure convergence of the evolutions of this class of algorithms to the average of initial states. Moreover, for a random sequence of graphs generated using a time-varying B-irreducible probability matrix, we establish convergence rates for the proposed push-sum algorithm.
Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Consensus (93D50)
This page was built for publication: Push-sum on random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6289718)
