https://murray.cds.caltech.edu/index.php?title=On_Quantized_Consensus_by_Means_of_Gossip_Algorithm_--_Part_I:_Convergence_Proof&feed=atom&action=historyOn Quantized Consensus by Means of Gossip Algorithm -- Part I: Convergence Proof - Revision history2022-12-02T01:47:57ZRevision history for this page on the wikiMediaWiki 1.37.2https://murray.cds.caltech.edu/index.php?title=On_Quantized_Consensus_by_Means_of_Gossip_Algorithm_--_Part_I:_Convergence_Proof&diff=19802&oldid=prevMurray: htdb2wiki: creating page for 2008q_lm09a-acc.html2016-05-15T06:16:48Z<p>htdb2wiki: creating page for 2008q_lm09a-acc.html</p>
<p><b>New page</b></p><div>{{HTDB paper<br />
| authors = Javad Lavaei, Richard M Murray<br />
| title = On Quantized Consensus by Means of Gossip Algorithm -- Part I: Convergence Proof<br />
| source = American Control Conference (ACC)<br />
| year = 2009<br />
| type = Preprint<br />
| funding = <br />
| url = http://www.cds.caltech.edu/~murray/preprints/lm09a-acc.pdf<br />
| abstract = 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 each other 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 properties of the system in the steady-state (after reaching the consensus) are also derived. The results developed here hold true for any arbitrary quantization, provided the tuning parameter of the gossip algorithm is chosen properly. The expected value of the convergence time bounded in the second part of the paper. <br />
| flags = <br />
| tag = lm09a-acc<br />
| id = 2008q<br />
}}</div>Murray