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 language | English (US) |
|---|---|
| Pages (from-to) | 221-235 |
| Number of pages | 15 |
| Journal | Linear Algebra and Its Applications |
| Volume | 437 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 1 2012 |
Fingerprint
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 journal › Article
}
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
VL - 437
SP - 221
EP - 235
JO - Linear Algebra and Its Applications
JF - Linear Algebra and Its Applications
SN - 0024-3795
IS - 1
ER -