The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Agreement over random networks
Abstract
We consider the agreement problem over random information networks. In a random network, the existence of an information channel between a pair of units at each time instance is probabilistic and independent of other channels; hence, the topology of the network varies over time. In such a framework, we address the asymptotic agreement for the networked units via notions from stochastic stability. Furthermore, we delineate on the rate of convergence as it relates to the algebraic connectivity of random graphs.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Nonnegative Matrices in the Mathematical Sciences
Berman, A., & Plemmons, R. J. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971262 · Cited by 3,573
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
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
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Penrose, M. (2003) · doi:10.1093/acprof:oso/9780198506263.001.0001 · Cited by 2,480
Janson, S., Łuczak, T., & Rucinski, A. (2000) · Wiley eBooks · doi:10.1002/9781118032718 · Cited by 1,545
Stochastic Stability and Control
(1967) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6039-4 · Cited by 1,452
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
Local Control Strategies for Groups of Mobile Autonomous Agents
Lin, Z., Broucke, M., & Francis, B. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.825639 · Cited by 850
The Number of Neighbors Needed for Connectivity of Wireless Networks
Xue, F., & Kumar, P. R. (2004) · Wireless Networks · doi:10.1023/b:wine.0000013081.09837.c0 · Cited by 821
Spectra of random graphs with given expected degrees
Chung, F., Lu, L., & Vu, V. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0937490100 · Cited by 492
Ultrafast consensus in small-world networks
Olfati-Saber, R. (2005) · Proceedings of the 2005, American Control Conference, 2005. · doi:10.1109/acc.2005.1470321 · Cited by 384
On State-dependent dynamic graphs and their controllability properties
Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.843858 · Cited by 161
Self-citationEigenvalues in Combinatorial Optimization
Mohar, B., & Poljak, S. (1993) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4613-8354-3_5 · Cited by 140
On a dynamic extension of the theory of graphs
Mesbahi, M. (2002) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2002.1023188 · Cited by 51
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
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Distributed Kalman filtering for sensor networks
Olfati-Saber, R. (2007) · 2007 46th IEEE Conference on Decision and Control · doi:10.1109/cdc.2007.4434303 · Cited by 1,586
Leader-following consensus of multi-agent systems under fixed and switching topologies
Ni, W., & Cheng, D. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.01.006 · Cited by 1,462
Metadata
- Authors
- Hatano, Y., & Mesbahi, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2005-11
- Volume
- 50
- Issue
- 11
- Pages
- 1867-1872
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W4247555059
- Cited by
- 503
- References
- 21
- FWCI
- 26.47
- 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.