CoChat

Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices

Open access
Benezit, Florence, Blondel, Vincent, Thiran, Patrick, Tsitsiklis, John, Vetterli, Martin · 2010 · 2010 IEEE International Symposium on Information Theory

The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.

Abstract

This 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.

Overview

Integrity signals

Registry

Crossref · 10.1109/isit.2010.5513273

Cites

16 of 16 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 16 references

Cited by

See all 261

Metadata

Authors
Benezit, F., Blondel, V., Thiran, P., Tsitsiklis, J., & Vetterli, M.
Affiliations
  • École Polytechnique Fédérale de Lausanne (CH)
  • Massachusetts Institute of Technology (US)
Venue
2010 IEEE International Symposium on Information Theory
Publisher
IEEE
Published
2010-06
Pages
1753-1757
OpenAlex
W2135674292
Cited by
224
References
16
Citations by year
2026: 3 · 2025: 5 · 2024: 11 · 2023: 9 · 2022: 12 · 2021: 14 · 2020: 15 · 2019: 20 · 2018: 26 · 2017: 16 · 2016: 17 · 2015: 17 · 2014: 16 · 2013: 11 · 2012: 24
FWCI
12.40
Type
conference paper
Language
en
Open access
Licence
cc-by-nc
Locations
  • IEEE International Symposium on Information Theory (ISIT) (publishedVersion)
  • Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
Funders
  • National Science Foundation (0701623)
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (67322)
  • Division of Electrical, Communications and Cyber Systems
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
  • Physical Sciences › Computer Science › Signal Processing › Advanced Adaptive Filtering Techniques
Keywords
distributed averaging, directed graphs, convergence

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices. https://app.cochat.ai/papers/10.1109/isit.2010.5513273
The paper
Benezit, F., Blondel, V., Thiran, P., Tsitsiklis, J., & Vetterli, M. (2010). Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices. 2010 IEEE International Symposium on Information Theory. https://doi.org/10.1109/isit.2010.5513273

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.