Stochastic consensus over weighted directed networks

Maurizio Porfiri, Daniel J. Stilwell

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


We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication between agents is modeled as a weighted directed random graph that switches periodically. The existence of any edge is probabilistic, and independent from the existence of any other edge. We further allow each edge to be weighted differently. Sufficient conditions for asymptotic almost sure consensus are presented for the case of positive weights, and for the case of arbitrary weights.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 American Control Conference, ACC
Number of pages6
StatePublished - 2007
Event2007 American Control Conference, ACC - New York, NY, United States
Duration: Jul 9 2007Jul 13 2007

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619


Other2007 American Control Conference, ACC
Country/TerritoryUnited States
CityNew York, NY

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Stochastic consensus over weighted directed networks'. Together they form a unique fingerprint.

Cite this