On the Equivalence and Condition of Different Consensus Over a Random Network Generated by i.i.d. Stochastic Matrices

DOI10.1109/TAC.2011.2107130MaRDI QIDQ5347724zbMATHFDO

Authors Qingshuo Song, Daniel W. C. Ho, Guanrong Chen

Publication date 25 August 2017

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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Discrete-time control/observation systems (93C55) Stochastic stability in control theory (93E15)

Recommendations

• A Necessary and Sufficient Condition for Consensus Over Random Networks
• Consensus Over Numerosity-Constrained Random Networks
• Consensus Over Random Graph Processes: Network Borel–Cantelli Lemmas for Almost Sure Convergence
• Consensus of switched multi-agent systems with random networks
• Consensus in nonlinear stationary networks with identical agents
• Stochastic approximation based consensus dynamics over Markovian networks
• Consensus on Matrix-Weighted Switching Networks
• Approximate Consensus in Stochastic Networks With Application to Load Balancing
• Deterministic versus stochastic consensus dynamics on graphs
• Interval consensus over random networks

This page was built for publication: On the Equivalence and Condition of Different Consensus Over a Random Network Generated by i.i.d. Stochastic Matrices

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