Degree Fluctuations and the Convergence Time of Consensus Algorithms

DOI10.1109/TAC.2013.2257969zbMATH Open1369.94626OpenAlexW2810643700MaRDI QIDQ5353373FDOQ5353373

Authors: 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)

Cited In (9)

• A Petri net approach to consensus in networks with joint-agent interactions
• Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
• On the estimation of the consensus rate of convergence in graphs with persistent interconnections
• Fast convergence for consensus in dynamic networks
• Fast convergence for consensus in dynamic networks
• Robustness sensitivities in large networks
• Geometric bounds for convergence rates of averaging algorithms
• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Finite-time error bounds for distributed linear stochastic approximation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353373)