Degree fluctuations and the convergence time of consensus algorithms

We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the degree of any given node is constant in time, we show that the algorithm achieves consensus within a given accuracy ∈ on n nodes in time O(n3ln(n=∈)). Because there is a direct relation between consensus algorithms in time-varying environments and inhomogeneous random walks, our result also translates into a general statement on such random walks. Moreover, we give simple proofs that the convergence time becomes exponentially large in the number of nodes n under slight relaxations of the above assumptions. We prove that exponential convergence time is possible for consensus algorithms on fixed directed graphs, and we use an example of Cao, Spielman, and Morse to give a simple argument that the same is possible if the constant degrees assumption is even slightly relaxed.

[1]  A. Odlyzko,et al.  Bounds for eigenvalues of certain stochastic matrices , 1981 .

[2]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[3]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[4]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[5]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[6]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  Emilio Frazzoli,et al.  On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithms , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Jorge Cortes,et al.  Notes on averaging over acyclic digraphs and discrete coverage control , 2006, CDC.

[9]  L. Saloff-Coste,et al.  Convergence of some time inhomogeneous Markov chains via spectral techniques , 2007 .

[10]  Asuman E. Ozdaglar,et al.  Rate of Convergence for Consensus with Delays , 2008, 2008 47th IEEE Conference on Decision and Control.

[11]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[12]  David Angeli,et al.  Tight estimates for convergence of some non-stationary consensus algorithms , 2007, Syst. Control. Lett..

[13]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach , 2008, SIAM J. Control. Optim..

[14]  Bernard Chazelle,et al.  Natural algorithms , 2009, SODA.

[15]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[16]  D. Angeli,et al.  Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees , 2006, SIAM J. Control. Optim..

[17]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[18]  Bernard Chazelle,et al.  Analytical Tools for Natural Algorithms , 2010, ICS.

[19]  Behrouz Touri,et al.  On existence of a quadratic comparison function for random weighted averaging dynamics and its implications , 2011, IEEE Conference on Decision and Control and European Control Conference.

[20]  Bernard Chazelle,et al.  The Total s-Energy of a Multiagent System , 2010, SIAM J. Control. Optim..