Fast convergence for consensus in dynamic networks

Authors:
T.-H. Hubert Chan;Li Ning
Affiliations:
The University of Hong Kong;The University of Hong Kong
Venue:
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Year:
2011

Citing 5
Cited 0

Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Natural algorithms

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Convergence Speed in Distributed Consensus and Averaging

SIAM Journal on Control and Optimization
Finite-time convergent gradient flows with applications to network consensus

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the convergence time required to achieve consensus in dynamic networks. In each time step, a node's value is updated to some weighted average of its neighbors' and its old values. We study the case when the underlying network is dynamic, and investigate different averaging models. Both our analysis and experiments show that dynamic networks exhibit fast convergence behavior, even under very mild connectivity assumptions.