We show that, if the consensus matrices are doubly stochastic, average consensus is achieved in the mean square sense and the almost sure sense if and only if the graph resulting from the union of graphs corresponding to the Markov process is strongly connected.Expand

We revisit the classic multi-agent distributed consensus problem. We adopt mild connectivity assumptions and with a novel application of the contraction coefficient we obtain simple yet general and… Expand

We revisit the linear distributed consensus problem in continuous time, to provide a simple and elegant proof under very mild assumptions and obtain new initial conditions for asymptotic flocking.Expand

We introduce and analyze a randomized gossip algorithm for solving the generalized consensus problem on convex metric spaces, where the communication between agents is controlled by a set of Poisson counters.Expand

Abstract This work studies a class of linear first order and non-linear second order static distributed consensus networks with time-varying multiple propagation delays, in continuous time. We… Expand

We revisit the general linear consensus problem and provide new conditions for asymptotic consensus on two types of stochastic versions of the algorithm, in discrete and continuous time.Expand