On the consensus protocol of conspecific agents

Nicole Abaid, Irina Igel, Maurizio Porfiri

Research output: Contribution to journalArticle

Abstract

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
Volume437
Issue number1
DOIs
StatePublished - Jul 1 2012

Fingerprint

Asymptotic Convergence
Additive noise
Additive Noise
Random variables
Mean Square
Updating
Convergence Rate
Cardinality
Closed-form
Deviation
Random variable
Topology
Communication
Class

Keywords

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

ASJC Scopus subject areas

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

Cite this

On the consensus protocol of conspecific agents. / Abaid, Nicole; Igel, Irina; Porfiri, Maurizio.

In: Linear Algebra and Its Applications, Vol. 437, No. 1, 01.07.2012, p. 221-235.

Research output: Contribution to journalArticle

Abaid, Nicole ; Igel, Irina ; Porfiri, Maurizio. / On the consensus protocol of conspecific agents. In: Linear Algebra and Its Applications. 2012 ; Vol. 437, No. 1. pp. 221-235.
@article{f592676997084debbfef2c01d3055ce2,
title = "On the consensus protocol of conspecific agents",
abstract = "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{\'e}nyi and numerosity-constrained networks.",
keywords = "Consensus protocol, Convergence rate, Directed network, Random topology, Stochastic stability",
author = "Nicole Abaid and Irina Igel and Maurizio Porfiri",
year = "2012",
month = "7",
day = "1",
doi = "10.1016/j.laa.2012.01.030",
language = "English (US)",
volume = "437",
pages = "221--235",
journal = "Linear Algebra and Its Applications",
issn = "0024-3795",
publisher = "Elsevier Inc.",
number = "1",

}

TY - JOUR

T1 - On the consensus protocol of conspecific agents

AU - Abaid, Nicole

AU - Igel, Irina

AU - Porfiri, Maurizio

PY - 2012/7/1

Y1 - 2012/7/1

N2 - 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.

AB - 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.

KW - Consensus protocol

KW - Convergence rate

KW - Directed network

KW - Random topology

KW - Stochastic stability

UR - http://www.scopus.com/inward/record.url?scp=84859537098&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859537098&partnerID=8YFLogxK

U2 - 10.1016/j.laa.2012.01.030

DO - 10.1016/j.laa.2012.01.030

M3 - Article

AN - SCOPUS:84859537098

VL - 437

SP - 221

EP - 235

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

SN - 0024-3795

IS - 1

ER -