Distributed strategies for average consensus in directed graphs
Abstract
We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology (graph). Specifically, we discuss how the nodes can asymptotically reach average consensus (i.e., obtain the average of their initial values) with linear-iterative algorithms in which each node updates its value using a weighted linear combination of its own value and the values of neighboring nodes. In the process, the strategies we develop allow the nodes to adapt their weights in a distributed fashion, so that asymptotically they obtain a doubly stochastic weight matrix, which is useful for many algorithms that utilize linear- or nonlinear-iterative schemes to perform various estimation and optimization tasks.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
The subgradient-push method is a perturbation of the push-sum protocol for averaging.
“As previously remarked, our protocol is a perturbation of the so-called 'push-sum' protocol for averaging studied in [1], [4], [10].”
From Distributed Optimization Over Time-Varying Directed Graphs (2015) · cites this paper as [4]
The citation lists haven’t been fetched yet
References 23 · Cited by 75
- Authors
- Domínguez-García, A. D., & Hadjicostis, C. N.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- 2011 50th IEEE Conference on Decision and Control and European Control Conference
- Publisher
- IEEE
- Published
- 2011-12
- Pages
- 2124-2129
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W1997775689
- Cited by
- 75
- References
- 23
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 3 · 2023: 8 · 2022: 1 · 2021: 3 · 2020: 9 · 2019: 9 · 2018: 11 · 2017: 2 · 2016: 6 · 2015: 5 · 2014: 4 · 2013: 9 · 2012: 2
- FWCI
- 4.56
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- IEEE Conference on Decision and Control (CDC) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Control Multi-Agent Systems
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Physical Sciences › Engineering › Computational Mechanics › Advanced Adaptive Filtering Techniques
- Keywords
- average consensus, directed graphs, distributed algorithms, strongly connected graphs, 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
