IEEE Transactions on Automatic Control, Vol.65, No.3, 1295-1302, 2020
Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
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 so-called time-varying -irreducible probability matrix, we establish convergence rates for the proposed push-sum algorithm.