Abstract
In this note we address the problem of reaching a consensus in an undirected network where the nodes interchange information with their neighbors. Each node is provided with a value X_i and a weight w_i. The speci c goal of the consensus is that each node will be aware of the weighted-average consensus value, in a distributed way, that is to say without a central control. We show the applicability of a theoretical result about reaching a consensus following an iterative algorithm.
