Show simple item record

dc.contributor.authorTsitsiklis, John N.
dc.contributor.authorBenezit, Florence
dc.contributor.authorBlondel, Vincent D.
dc.contributor.authorThiran, Patrick
dc.contributor.authorVetterli, Martin
dc.date.accessioned2012-09-25T12:45:25Z
dc.date.available2012-09-25T12:45:25Z
dc.date.issued2010-07
dc.date.submitted2010-06
dc.identifier.isbn978-1-4244-7890-3
dc.identifier.isbn978-1-4244-7891-0
dc.identifier.urihttp://hdl.handle.net/1721.1/73148
dc.description.abstractThis paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any connected, directed or undirected graph. Unlike most previous gossip algorithms, Weighted Gossip admits stochastic update matrices which need not be doubly stochastic. Double-stochasticity being very restrictive in a distributed setting, this novel degree of freedom is essential and it opens the perspective of designing a large number of new gossip-based algorithms. To give an example, we present one of these algorithms, which we call One-Way Averaging. It is based on random geographic routing, just like Path Averaging, except that routes are one way instead of round trip. Hence in this example, getting rid of double stochasticity allows us to add robustness to Path Averaging.en_US
dc.description.sponsorshipSwiss National Science Foundation (grant 5005-67322)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant ECCS-0701623)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/ 10.1109/ISIT.2010.5513273en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceIEEEen_US
dc.titleWeighted gossip: Distributed averaging using non-doubly stochastic matricesen_US
dc.typeArticleen_US
dc.identifier.citationTsitsiklis, John N. et al. "Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices." Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT): 1753-1757. © 2010 IEEE.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverTsitsiklis, John N.
dc.contributor.mitauthorTsitsiklis, John N.
dc.relation.journalProceedings of the IEEE International Symposium on Information Theory (ISIT), 2010en_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsBenezit, Florence; Blondel, Vincent; Thiran, Patrick; Tsitsiklis, John; Vetterli, Martinen
dc.identifier.orcidhttps://orcid.org/0000-0003-2658-8239
mit.licensePUBLISHER_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record