The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Abstract
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, strongly rooted, and neighbor-shared are defined, and conditions are derived for compositions of sequences of directed graphs to be of these types. The graph of a stochastic matrix is defined, and it is shown that under certain conditions the graph of a Sarymsakov matrix and a rooted graph are one and the same. As an illustration of the use of the concepts developed in this paper, graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek consensus problem.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Doob, J. L., & Doob, J. L. (1953) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,053
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-citationGodsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37406 · Cited by 7,714
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37406 · Cited by 5,148
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
Parallel and distributed computation
Bertsekas, D. P., Tsitsiklis, J. N., & Sennikov, A. N. (1989) · Cited by 1,187
Convergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Products of indecomposable, aperiodic, stochastic matrices
Wolfowitz, J. (1963) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1963-0154756-3 · Cited by 522
Towards consensus: some convergence theorems on repeated averaging
Chatterjee, S., & Seneta, E. B. (1977) · Journal of Applied Probability · doi:10.1017/s0021900200104681 · Cited by 368
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657029 · Cited by 329
Self-citationSynchronization and Convergence of Linear Dynamics in Random Directed Networks
Wu, C. W. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878783 · Cited by 250
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929387 · Cited by 226
Self-citationA Lower Bound on Convergence of a Distributed Network Consensus Algorithm
Cao, M., Spielman, D. A., & Morse, A. S. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1582514 · Cited by 118
Self-citationCOORDINATION OF AN ASYNCHRONOUS MULTI-AGENT SYSTEM VIA AVERAGING
Cao, M., Morse, A. S., & Anderson, B. D. O. (2005) · IFAC Proceedings Volumes · doi:10.3182/20050703-6-cz-1902.01081 · Cited by 38
Self-citation
Cited by
Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
Yu, W., Chen, G., & Cao, M. (2010) · Automatica · doi:10.1016/j.automatica.2010.03.006 · Cited by 1,390
Self-citationSecond-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
Yu, W., Chen, G., Cao, M., & Kurths, J. (2010) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2031624 · Cited by 1,120
Self-citationConvergence Speed in Distributed Consensus and Averaging
Olshevsky, A., & Tsitsiklis, J. N. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060678324 · Cited by 692
Chen, C. L. P., Wen, G.-X., Liu, Y.-J., & Wang, F.-Y. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2302477 · Cited by 634
A tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
Metadata
- Authors
- Cao, M., Morse, A. S., & Anderson, B. D. O.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2008-01
- Volume
- 47
- Issue
- 2
- Pages
- 575-600
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2019312235
- Cited by
- 563
- References
- 25
- FWCI
- 45.54
- 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
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.