On quantized consensus by means of gossip algorithm - Part I: Convergence proof

By Javad Lavaei, Richard M. Murray. 2009

35 citations recorded by the source corpus.

This paper is concerned with the distributed averaging problem subject to a quantization constraint. Given a group of agents associated with scalar numbers, it is assumed that each pair of agents can communicate with a prescribed probability, and that the data being exchanged between them is quantized. In this part of the paper, it is proved that the stochastic gossip algorithm proposed in a recent paper leads to reaching the quantized consensus. Some important steady-state properties of the system (after reaching the consensus) are also derived. The results developed here hold true for any arbitrary quantization, provided that the tuning parameter of the gossip algorithm is chosen properly. The expected value of the convergence time is lower and upper bounded in the second part of the paper.

Subfields: Computer Networks and Communications, Public Health, Environmental and Occupational Health

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Public Health, Environmental and Occupational Health

Citations in the corpus

Gossip consensus algorithms via quantized communication (2009, background): “This fact has actually been proven for any ε ∈ (0, 1/2] in the pair of recent conference papers [10,11].”
On quantized consensus by means of gossip algorithm - Part II: Convergence time (2009, background): “Recall that the proof of Theorem 2 in Part I of the paper proposes two storage functions as follows [21]:”