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 B-irreducible probability matrix, we establish convergence rates for the proposed push-sum algorithm.
6 February 2023 in Transportation Research Part C: Emerging Technologies
We consider a distributed optimization problem for the sum of convex functions where the underlying communication network connecting nodes at each time epoch is drawn at random from a collection of directed graphs. We propose a modified version of the subgradient-push algorithm that provably almost surely converges to an optimizer on any such sequence of random directed graphs. We also prove that the convergence rate of our proposed algorithm is upper bounded as $ O(\frac{1}{\sqrt{t}})$ , where $t$ is the time horizon