Asymptotic analysis of quadratic error of consensus in large-scale random directed networks

We analyze the asymptotic variance of distributed consensus algorithms over large-scale switching random networks. Our analysis is focused on consensus algorithms over large, i.i.d., and directed Erdős-Rényi random graphs. We assume that every agent can communicate with any other agent with some fixed probability c/n, where c is the expected number of neighbors of each agent and n is the size of the network. We compute the variance of the random consensus value and show that it converges to zero at rate 1/n as the number of agents grows. We provide numerical simulations that illustrate our results.

[1]  Alireza Tahbaz-Salehi,et al.  Consensus Over Ergodic Stationary Graph Processes , 2010, IEEE Transactions on Automatic Control.

[2]  Maurizio Porfiri,et al.  Consensus Seeking Over Random Weighted Directed Graphs , 2007, IEEE Transactions on Automatic Control.

[3]  Asuman E. Ozdaglar,et al.  Spread of (Mis)Information in Social Networks , 2009, Games Econ. Behav..

[4]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007 .

[5]  Alireza Tahbaz-Salehi,et al.  A Necessary and Sufficient Condition for Consensus Over Random Networks , 2008, IEEE Transactions on Automatic Control.

[6]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[7]  Giorgio Picci,et al.  Almost sure convergence of random gossip algorithms , 2007, 2007 46th IEEE Conference on Decision and Control.

[8]  Chai Wah Wu,et al.  Synchronization and convergence of linear dynamics in random directed networks , 2006, IEEE Transactions on Automatic Control.

[9]  John S. Baras,et al.  Almost sure convergence to consensus in Markovian random graphs , 2008, 2008 47th IEEE Conference on Decision and Control.

[10]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).