Degree Fluctuations and the Convergence Time of Consensus Algorithms

We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus is achieved within a given accuracy ε on n nodes in time B+4n3 Bln(2n/ε). Because there is a direct relation between consensus algorithms in time-varying environments and in homogeneous random walks, our result also translates into a general statement on such random walks. Moreover, we give a simple proof of a result of Cao, Spielman, and Morse that the worst case convergence time becomes exponentially large in the number of nodes n under slight relaxation of the degree constancy assumption.

[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]  Andrei Z. Broder,et al.  On the second eigenvalue of random regular graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

[5]  J. Geromel,et al.  Convex analysis of output feedback control problems: robust stability and performance , 1996, IEEE Trans. Autom. Control..

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

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

[8]  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.

[9]  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.

[10]  Francesco Bullo,et al.  Notes on averaging over acyclic digraphs and discrete coverage control , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[11]  Lei Zhang,et al.  Communication and control co-design for networked control systems , 2006, Autom..

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

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

[14]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[15]  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..

[16]  C. Avin,et al.  How to Explore a Fast-Changing World , 2008 .

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

[18]  João Pedro Hespanha,et al.  Exponential stability of impulsive systems with application to uncertain sampled-data systems , 2008, Syst. Control. Lett..

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

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

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

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

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

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

[25]  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.

[26]  Dong Yue,et al.  Output Feedback Control of Discrete-Time Systems in Networked Environments , 2011, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

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

[28]  Nathan van de Wouw,et al.  Stability Analysis of Networked Control Systems Using a Switched Linear Systems Approach , 2009, IEEE Transactions on Automatic Control.

[29]  Martyn Amos,et al.  Enhancing GPU parallelism in nature-inspired algorithms , 2012, The Journal of Supercomputing.

[30]  Bernard Chazelle,et al.  The Convergence of Bird Flocking , 2009, JACM.