Degree Fluctuations and the Convergence Time of Consensus Algorithms

DOI10.1109/TAC.2013.2257969zbMath1369.94626OpenAlexW2810643700MaRDI QIDQ5353373

Alex Olshevsky, John N. Tsitsiklis

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2013.2257969

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms ⋮ On the estimation of the consensus rate of convergence in graphs with persistent interconnections ⋮ Geometric bounds for convergence rates of averaging algorithms ⋮ Robustness Sensitivities in Large Networks ⋮ Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds ⋮ A Petri net approach to consensus in networks with joint-agent interactions ⋮ Fast Convergence for Consensus in Dynamic Networks ⋮ Fast Convergence for Consensus in Dynamic Networks

This page was built for publication: Degree Fluctuations and the Convergence Time of Consensus Algorithms