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

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

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

Abstract

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 Erdocombining double acute accents-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.

Original languageEnglish (US)
Title of host publication2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Pages778-782
Number of pages5
DOIs
StatePublished - 2009
Event2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 - Monticello, IL, United States
Duration: Sep 30 2009Oct 2 2009

Publication series

Name2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Other

Other2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Country/TerritoryUnited States
CityMonticello, IL
Period9/30/0910/2/09

ASJC Scopus subject areas

  • General Computer Science
  • Control and Systems Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Asymptotic analysis of quadratic error of consensus in large-scale random directed networks'. Together they form a unique fingerprint.

Cite this