Averaging Over General Random Networks
From MaRDI portal
Cited in
(4)- Distributed Averaging With Random Network Graphs and Noises
- On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs
- Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
- Average consensus for multi-agent system with measurement noise and binary-valued communication
This page was built for publication: Averaging Over General Random Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353051)