Consensus seeking over random weighted directed graphs

Maurizio Porfiri, Daniel L. Stilwell

Research output: Contribution to journalArticlepeer-review


We examine the consensus problem for a group of agents that communicate via a stochastic information network. Communication among 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)
Pages (from-to)1767-1773
Number of pages7
JournalIEEE Transactions on Automatic Control
Issue number9
StatePublished - Sep 2007


  • Consensus problem
  • Directed graphs
  • Fast switching
  • Random graphs
  • Weighted graphs

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Consensus seeking over random weighted directed graphs'. Together they form a unique fingerprint.

Cite this