Degree fluctuations and the convergence time of consensus algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the degree of any given node is constant in time, we show that the algorithm achieves consensus within a given accuracy ∈ on n n...
Main Author: | Tsitsiklis, John N. |
---|---|
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/73573 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
Degree Fluctuations and the Convergence Time of Consensus Algorithms
by: Olshevsky, Alex, et al.
Published: (2021) -
A New Condition for Convergence in Continuous-Time Consensus Seeking Systems
by: Hendrickx, Julien, et al.
Published: (2012) -
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) -
Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems
by: Hendrickx, Julien, et al.
Published: (2014)