Linear Stochastic Approximation Algorithms and Group Consensus Over Random Signed Networks

DOI10.1109/TAC.2018.2867257zbMATH Open1482.93665OpenAlexW2889159892MaRDI QIDQ5223693FDOQ5223693

Authors: Ge Chen, Xiaoming Duan, Wenjun Mei, Francesco Bullo 

Publication date: 18 July 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2018.2867257

Mathematics Subject Classification ID

Stochastic approximation (62L20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic stability in control theory (93E15)

Cited In (2)

• Stochastic bipartite consensus with measurement noises and antagonistic information
• Reach almost sure consensus via \(L_p\)-norm group information

This page was built for publication: Linear Stochastic Approximation Algorithms and Group Consensus Over Random Signed Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223693)