Convergence time analysis of quantized gossip consensus on digraphs
From MaRDI portal
Publication:1937530
DOI10.1016/j.automatica.2012.06.048zbMath1258.93002arXiv1105.1668OpenAlexW2963892017MaRDI QIDQ1937530
Publication date: 1 March 2013
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.1668
Lyapunov functionMarkov chainsdirected graphsaverage consensusconvergence timequantized consensusdecay timerandomized gossip algorithms
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)
Related Items
Cites Work
- Gossip consensus algorithms via quantized communication
- Quantized consensus
- Markov Chains
- Distributed Average Consensus With Dithered Quantization
- Broadcast Gossip Algorithms for Consensus
- On Distributed Averaging Algorithms and Quantization Effects
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Quantized Consensus and Averaging on Gossip Digraphs
- Quantized Consensus by Means of Gossip Algorithm