A lower bound for distributed averaging algorithms on the line graph
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 cond...
Main Authors: | Tsitsiklis, John N., Olshevsky, Alexander |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
Online Access: | http://hdl.handle.net/1721.1/73151 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
On Distributed Averaging Algorithms and Quantization Effects
by: Tsitsiklis, John N., et al.
Published: (2010) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2010) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2020) -
A lower bound on the performance of dynamic curing policies for epidemics on graphs
by: Drakopoulos, Kimon, et al.
Published: (2017) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander
Published: (2007)