Average consensus by gossip algorithms with quantized communication
Paolo Frasca, Ruggero Carli, Fabio Fagnani, Sandro Zampieri · 2008
This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to the average value, up to the size of the quantization bins, whenever the the graph is connected. Moreover, its speed of convergence is estimated.