Almost sure exponential convergence to consensus of random gossip algorithms
From MaRDI portal
Publication:2847260
DOI10.1002/rnc.2844zbMath1271.93143OpenAlexW1569712887MaRDI QIDQ2847260
Giorgio Picci, Thomas J. S. Taylor
Publication date: 4 September 2013
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rnc.2844
Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Decentralized systems (93A14) Stochastic systems in control theory (general) (93E03)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On direct convergence and periodicity for transition probabilities of Markov chains in random environments
- Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
- Ergodic theory of differentiable dynamical systems
- Markov chains with stochastically stationary transition probabilities
- Almost sure exponential convergence to consensus of random gossip algorithms
- The ergodic theory of Markov chains in random environments
- Gossiping With Multiple Messages
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus Over Ergodic Stationary Graph Processes
- On Conditions for Convergence to Consensus
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Spatial gossip and resource location protocols
- Products of Indecomposable, Aperiodic, Stochastic Matrices
This page was built for publication: Almost sure exponential convergence to consensus of random gossip algorithms
