Agreement over random networks
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (01912216), 2010-2015 Vol.2
- https://doi.org/10.1109/cdc.2004.1430343
Abstract
We consider the agreement problem over random information networks. In a random network, the existence of an information channel between a pair of elements 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 elements via notions from stochastic stability. Furthermore, we delineate on the rate of convergence as it relates to the algebraic connectivity of random graphs.Keywords
This publication has 15 references indexed in Scilit:
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Fast linear iterations for distributed averagingSystems & Control Letters, 2004
- State-dependent graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Coordination of groups of mobile autonomous agents using nearest neighbor rulesIEEE Transactions on Automatic Control, 2003
- Spectra of random graphs with given expected degreesProceedings of the National Academy of Sciences, 2003
- On a dynamic extension of the theory of graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Random GraphsPublished by Cambridge University Press (CUP) ,2001
- Algebraic Graph TheoryPublished by Springer Nature ,2001
- Laplace eigenvalues and bandwidth-type invariants of graphsJournal of Graph Theory, 1993
- Eigenvalues in Combinatorial OptimizationPublished by Springer Nature ,1993