On the convergence of weighted-average consensus

2013/07/29 by Francisco Pedroche, Miguel Rebollo, Pedroche, Francisco +5
Computer Science · Engineering · #15B48 #65F10 #Advanced Memory and Neural Computing #Distributed Control Multi-Agent Systems #FOS: Electrical engineering #FOS: Mathematics #Neural Networks Stability and Synchronization #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1307.7562

openalex publication_date 2013/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory to prove the main result. As a particular case one can obtain well-known results for non-weighted average consensus. We also give a corollary for undirected graphs.

Citations

• Consensus and Cooperation in Networked Multi-Agent Systems

Related

• Finite-time and Asymptotic Convergence of Distributed Averaging and Maximizing Algorithms
• Degree Fluctuations and the Convergence Time of Consensus Algorithms
• On Distributed Average Consensus Algorithms
• Graph diameter, eigenvalues, and minimum-time consensus
• Consensus over Weighted Directed Graphs: A Robustness Perspective