TY - GEN
T1 - On consensus over random networks
AU - Tahbaz-Salehi, Alireza
AU - Jadbabaie, Ali
PY - 2006/1/1
Y1 - 2006/1/1
N2 - We consider the decentralized consensus problem over random information networks. In such networks, the underlying graph of the network at a given time instance is random and independent of all other times. For such a framework, we present a simple necessary and sufficient criteria for asymptotic consensus using simple ergodicity and probabilistic arguments. Finally, we investigate a special case for which the decentralized consensus algorithm converges to the average of the initial values.
AB - We consider the decentralized consensus problem over random information networks. In such networks, the underlying graph of the network at a given time instance is random and independent of all other times. For such a framework, we present a simple necessary and sufficient criteria for asymptotic consensus using simple ergodicity and probabilistic arguments. Finally, we investigate a special case for which the decentralized consensus algorithm converges to the average of the initial values.
UR - http://www.scopus.com/inward/record.url?scp=84940654054&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84940654054&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84940654054
T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006
SP - 1315
EP - 1321
BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006
PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
T2 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006
Y2 - 27 September 2006 through 29 September 2006
ER -