On the consensus protocol of conspecific agents

Nicole Abaid, Irina Igel, Maurizio Porfiri

Research output: Contribution to journalArticlepeer-review


We present a class of consensus protocols over groups of agents with stochastically switching, directed, and weighted communication topologies. In this protocol, an agent's traits, that is, the cardinality of its neighbor set and the weight assigned to its neighbors in the updating process, are given by two jointly distributed random variables and the neighbors of an agent are selected with equal probability. We provide closed form results for the asymptotic convergence rate and for the steady state mean square deviation in the presence of additive noise. These results are specialized to consensus protocols based on Erds-Rényi and numerosity-constrained networks.

Original languageEnglish (US)
Pages (from-to)221-235
Number of pages15
JournalLinear Algebra and Its Applications
Issue number1
StatePublished - Jul 1 2012


  • Consensus protocol
  • Convergence rate
  • Directed network
  • Random topology
  • Stochastic stability

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On the consensus protocol of conspecific agents'. Together they form a unique fingerprint.

Cite this