Student or educator? Sign up with your school email and get 6 months of Pro free.

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

On Distributed Averaging Algorithms and Quantization Effects

Open access
Nedic, A., Olshevsky, A., Ozdaglar, A., Tsitsiklis, J.N. · 2009 · IEEE Transactions on Automatic Control

Abstract

We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We study a large and natural class of averaging algorithms, which includes the vast majority of algorithms proposed to date, and provide tight polynomial bounds on their convergence time. We also describe an algorithm within this class whose convergence time is the best among currently available averaging algorithms for time-varying topologies. We then propose and analyze distributed averaging algorithms under the additional constraint that agents can only store and communicate quantized information, so that they can only converge to the average of the initial values of the agents within some error. We establish bounds on the error and tight bounds on the convergence time, as a function of the number of quantization levels.

Overview

Integrity signals

Registry

Crossref · 10.1109/tac.2009.2031203

Cites

28 of 28 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.

Citations

Cites

Show all 29 references

Research works printed but not linked: 1

  1. carli, 2005, Communication Constraints in the State Agreement Problem

Cited by

See all 582

Metadata

Authors
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N.
Affiliations
Massachusetts Institute of Technology (US)
Venue
IEEE Transactions on Automatic Control
Published
2009-11
Volume
54
Issue
11
Pages
2506-2517
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2140655807
Cited by
557
References
29
Citations by year
2026: 7 · 2025: 10 · 2024: 11 · 2023: 16 · 2022: 23 · 2021: 23 · 2020: 31 · 2019: 25 · 2018: 42 · 2017: 38 · 2016: 44 · 2015: 35 · 2014: 32 · 2013: 55 · 2012: 53
FWCI
65.84
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Automatic Control (publishedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
Funders
  • National Science Foundation (0545910, 0742538, 0701623)
  • Defense Advanced Research Projects Agency
  • Division of Civil, Mechanical and Manufacturing Innovation
  • Division of Electrical, Communications and Cyber Systems
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Engineering › Control and Systems Engineering › Stability and Control of Uncertain Systems
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
Keywords
distributed averaging, time-varying topology, convergence time, quantization levels, polynomial bounds, distributed iterative algorithm, multi-agent systems

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: On Distributed Averaging Algorithms and Quantization Effects. https://app.cochat.ai/papers/10.1109/tac.2009.2031203
The paper
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009). On Distributed Averaging Algorithms and Quantization Effects. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2009.2031203

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.