A Lower Bound on Convergence of a Distributed Network Consensus Algorithm
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
This paper gives a lower bound on the convergence rate of a class of network consensus algorithms. Two different approaches using directed graphs as a main tool are introduced: one is to compute the "scrambling constants" of stochastic matrices associated with "neighbor shared graphs" and the other is to analyze random walks on a sequence of graphs. Both approaches prove that the time to reach consensus within a dynamic network is logarithmic in the relative error and is in worst case exponential in the size of the network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Self-citation
Cited by
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
“[8], and Olshevsky and Tsitsiklis [9], [10]).”
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Li, T., & Zhang, J.-F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2042982 · Cited by 606
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657005 · Cited by 563
Self-citationNonlinear and Optimal Control Theory
Agrachev, A. A., Morse, A. S., Sontag, E. D., Sussmann, H. J., & Utkin, V. I. (2008) · Lecture Notes in Mathematics · doi:10.1007/978-3-540-77653-6 · Cited by 357
Self-citationDistributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351
“[6], Olshevsky and Tsitsiklis [17], [18], and Nedić et al.”
BackgroundCao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657029 · Cited by 329
Self-citationReaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
Shi, G., Johansson, K. H., & Hong, Y. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2215261 · Cited by 288
Convergence rate for consensus with delays
Nedić, A., & Ozdaglar, A. (2010) · Journal of Global Optimization · doi:10.1007/s10898-008-9370-2 · Cited by 198
Distributed multi-agent optimization with state-dependent communication
Lobel, I., Ozdaglar, A., & Feijer, D. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0467-x · Cited by 162
“One strand focuses on reaching consensus on a particular scalar value or computing exact averages of the initial values of the agents, as natural models of cooperative behavior in networked-systems (for deterministic models, see [8,13,21] and [22]); for randomized models, where the randomness may be due to the choice…”
Background
Metadata
- Authors
- Cao, M., Spielman, D. A., & Morse, A. S.
- Venue
- Proceedings of the 44th IEEE Conference on Decision and Control
- Publisher
- IEEE
- Published
- 2006-10-04
- Pages
- 2356-2361
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2112753256
- Cited by
- 116
- References
- 2
- FWCI
- 5.60
- Type
- conference paper
- Language
- en
- Open access
- green
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
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.