Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
Reaching consensus in wireless networks with probabilistic broadcast
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Randomized consensus algorithms over large scale networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 22.14 |
This paper considers randomized discrete-time consensus systems that preserve the average ''on average''. As a main result, we provide an upper bound on the mean square deviation of the consensus value from the initial average. Then, we apply our result to systems in which few or weakly correlated interactions take place: these assumptions cover several algorithms proposed in the literature. For such systems we show that, when the network size grows, the deviation tends to zero, and that the speed of this decay is not slower than the inverse of the size. Our results are based on a new approach, which is unrelated to the convergence properties of the system.