Fast Convergence for Consensus in Dynamic Networks

DOI10.1145/2601072zbMath1333.68207OpenAlexW1973153469MaRDI QIDQ5890568

T.-H. Hubert Chan, Li Ning

Publication date: 11 April 2016

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/152001

zbMATH Keywords

dynamic networksconsensus problemnatural algorithmsconvergent behaviorweighted averaging model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (1)

The temporal explorer who returns to the base

Uses Software

• Boids

Cites Work

• 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
• Unnamed Item

This page was built for publication: Fast Convergence for Consensus in Dynamic Networks