On consensus over stochastically switching directed topologies

Authors:
Sundaram Vanka;Vijay Gupta;Martin Haenggi
Affiliations:
Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 5
Cited 0

Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Communication constraints in the average consensus problem

Automatica (Journal of IFAC)
Power-delay analysis of consensus algorithms on wireless networks with interference

International Journal of Systems, Control and Communications
Sensor Networks With Random Links: Topology Design for Distributed Consensus

IEEE Transactions on Signal Processing - Part II
Randomized consensus algorithms over large scale networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider average consensus algorithms executed over stochastically varying communication topologies that may be unbalanced. It is known that the state values will reach consensus, under fairly weak conditions. However, the consensus value is a random variable. We provide concentration bounds for the distance of the state vector from the consensus subspace and for the asymptotic distribution of the value to which the various nodes converge as they reach consensus. The results allow the analysis of average consensus over wireless communication networks with more realistic assumptions than before.