Academic Commons


Consensus Over Ergodic Stationary Graph Processes

Tahbaz-Salehi, Alireza; Jadbabaie, Ali

In this technical note, we provide a necessary and sufficient condition for convergence of consensus algorithms when the underlying graphs of the network are generated by an ergodic and stationary random process. We prove that consensus algorithms converge almost surely, if and only if, the expected graph of the network contains a directed spanning tree. Our results contain the case of independent and identically distributed graph processes as a special case. We also compute the mean and variance of the random consensus value that the algorithm converges to and provide a necessary and sufficient condition for the distribution of the consensus value to be degenerate.


Also Published In

IEEE Transactions on Automatic Control

More About This Work

Academic Units
Published Here
September 7, 2011