A lower bound for distributed averaging algorithms

We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose state consists of a single real number and whose (possibly nonlinear) update function satisfies a natural smoothness condition has a worst case running time of at least on the order of $n^2$ on a network of $n$ nodes. Our results suggest that increased memory or expansion of the state space is crucial for improving the running times of distributed averaging algorithms.

[1]  Sonia Martínez,et al.  On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms , 2010, IEEE Transactions on Automatic Control.

[2]  Kyomin Jung,et al.  Distributed Averaging Via Lifted Markov Chains , 2009, IEEE Transactions on Information Theory.

[3]  Rolf Stadler,et al.  Gossiping for threshold detection , 2009, 2009 IFIP/IEEE International Symposium on Integrated Network Management.

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

[5]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[6]  Naoki Hayashi,et al.  Application of a consensus problem to fair multi-resource allocation in real-time systems , 2008, 2008 47th IEEE Conference on Decision and Control.

[7]  Han-Lim Choi,et al.  Consensus-Based Auction Approaches for Decentralized Task Assignment , 2008 .

[8]  Mac Schwager,et al.  Consensus learning for distributed coverage control , 2008, 2008 IEEE International Conference on Robotics and Automation.

[9]  Ruggero Carli,et al.  Distributed Kalman filtering based on consensus strategies , 2008, IEEE Journal on Selected Areas in Communications.

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

[11]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.

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

[13]  Jorge Cortés,et al.  Finite-time convergent gradient flows with applications to network consensus , 2006, Autom..

[14]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Jonathan P. How,et al.  An unbiased Kalman consensus algorithm , 2006, 2006 American Control Conference.

[16]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Path , 2006, Am. Math. Mon..

[17]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[18]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[19]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[20]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[21]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[22]  Huaiqing Wang,et al.  Multi-agent coordination using nearest neighbor rules: revisiting the Vicsek model , 2004, ArXiv.

[23]  Qun Li,et al.  Global clock synchronization in sensor networks , 2006, IEEE Transactions on Computers.

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

[25]  A. Jadbabaie,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

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