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

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

Average Consensus in the Presence of Delays in Directed Graph Topologies

Hadjicostis, Christoforos N., Charalambous, Themistoklis·2014·IEEE Transactions on Automatic Control

Abstract

Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this work, we propose a protocol that overcomes this limitation and, unlike existing consensus protocols in the presence of delays, ensures asymptotic consensus to the exact average, despite the presence of arbitrary (but bounded) delays in the communication links. The protocol requires that each component has knowledge of the number of its out-neighbors (i.e., the number of components to which it can send information) and its proof of correctness relies on the weak convergence of a backward product of column stochastic matrices. The proposed algorithm is demonstrated via illustrative examples.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2013.2275669

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 169

Metadata

Authors
Hadjicostis, C. N., & Charalambous, T.
Venue
IEEE Transactions on Automatic Control
Published
2014-03
Volume
59
Issue
3
Pages
763-768
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W1982131419
Cited by
169
References
2
FWCI
11.89
Type
journal article
Language
en
Open access
closed

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: Average Consensus in the Presence of Delays in Directed Graph Topologies. https://app.cochat.ai/papers/10.1109/tac.2013.2275669
The paper
Hadjicostis, C. N., & Charalambous, T. (2014). Average Consensus in the Presence of Delays in Directed Graph Topologies. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2013.2275669

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.