Convergence Speed in Distributed Consensus and Averaging

Authors:
Alex Olshevsky;John N. Tsitsiklis
Affiliations:
alex_o@mit.edu and jnt@mit.edu;-
Venue:
SIAM Journal on Control and Optimization
Year:
2009

Citing 0
Cited 14

Brief paper: Discrete-time dynamic average consensus

Automatica (Journal of IFAC)
Distributed throughput maximization in wireless networks via random power allocation

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
A geometric approach to collective motion

Proceedings of the twenty-sixth annual symposium on Computational geometry
Optimization and analysis of distributed averaging with short node memory

IEEE Transactions on Signal Processing
Convergence rate for consensus with delays

Journal of Global Optimization
Direction election in flocking swarms

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Fast convergence for consensus in dynamic networks

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Robust distributed orthogonalization based on randomized aggregation

Proceedings of the second workshop on Scalable algorithms for large-scale systems
Self-aware distributed consensus building for sensor networks

ISRN Communications and Networking
Distributed static linear Gaussian models using consensus

Neural Networks
Opinion Fluctuations and Disagreement in Social Networks

Mathematics of Operations Research
Analysis of accelerated gossip algorithms

Automatica (Journal of IFAC)
Technical communique: On iterative learning algorithms for the formation control of nonlinear multi-agent systems

Automatica (Journal of IFAC)
A decentralized and self organizing architecture for wide area synchronized monitoring of smart grids

Journal of High Speed Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm.