Convergence Rates in Distributed Consensus and Averaging

descriptionPublicationkeyboard_double_arrow_right Article , Conference object 01 Jan 2006Publisher:IEEEJournal:Proceedings of the 45th IEEE Conference on Decision and Control

Authors: Alex Olshevsky; John N. Tsitsiklis;

doi: 10.1109/cdc.2006.376899

Convergence Rates in Distributed Consensus and Averaging

- Summary
- Metrics

Abstract

We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the convergence time.

Related Organizations

Massachusetts Institute of Technology
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	99
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 1%