Variance analysis of randomized consensus in switching directed networks

Victor M. Preciado, Alireza Tahbaz-Salehi, Ali Jadbabaie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations


In this paper, we study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed Erdo″s-Ŕnyi random graphs, where each agent can communicate with any other agent with some exogenously specified probability p. While it is well-known that consensus algorithms over Erdo″s-Ŕnyi random networks result in an asymptotic agreement over the network, an analytical characterization of the distribution of the asymptotic consensus value remains an open question. In this paper, we provide closed-form expressions for the mean and variance of the asymptotic random consensus value, in terms of the size of the network and the probability of communication p. We also provide numerical simulations that illustrate our results.

Original languageEnglish (US)
Title of host publicationProceedings of the 2010 American Control Conference, ACC 2010
PublisherIEEE Computer Society
Number of pages6
ISBN (Print)9781424474264
StatePublished - 2010

Publication series

NameProceedings of the 2010 American Control Conference, ACC 2010

ASJC Scopus subject areas

  • Control and Systems Engineering


Dive into the research topics of 'Variance analysis of randomized consensus in switching directed networks'. Together they form a unique fingerprint.

Cite this