Fast Convergence for Consensus in Dynamic Networks
From MaRDI portal
Publication:5892613
DOI10.1007/978-3-642-22012-8_41zbMath1333.68050OpenAlexW2174406173MaRDI QIDQ5892613
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/152001
Uses Software
Cites Work
- Unnamed Item
- Finite-time convergent gradient flows with applications to network consensus
- Bounds for eigenvalues of certain stochastic matrices
- Convergence to Consensus by General Averaging
- On Communication Requirements for Multi-agent Consensus Seeking
- Reaching a Consensus
- On Distributed Averaging Algorithms and Quantization Effects
- Convergence Speed in Distributed Consensus and Averaging
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Stability of multiagent systems with time-dependent communication links
- Emergent Behavior in Flocks
- Flocking in Fixed and Switching Networks
- Degree Fluctuations and the Convergence Time of Consensus Algorithms
This page was built for publication: Fast Convergence for Consensus in Dynamic Networks