Convergence rate on periodic gossiping
From MaRDI portal
Publication:2282871
Recommendations
Cites work
- A Distributed Algorithm for Solving a Linear Algebraic Equation
- Algebraic criteria for second-order global consensus in multi-agent networks with intrinsic nonlinear dynamics and directed topologies
- Analysis of accelerated gossip algorithms
- Concordance and consensus
- Consensus on compact Riemannian manifolds
- Convergence of periodic gossiping algorithms
- Convergence speed in distributed consensus and averaging
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Fast linear iterations for distributed averaging
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 3445421 (Why is no real title available?)
- Matrix Analysis
- Optimal topological design for distributed estimation over sensor networks
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Cited in
(9)- Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes
- Request-based gossiping without deadlocks
- Distributed consensus-based estimation and control of large-scale systems under gossip communication protocol
- Gossip over holonomic graphs
- Analysis of accelerated gossip algorithms
- Almost sure exponential convergence to consensus of random gossip algorithms
- The contraction coefficient of a complete gossip sequence
- Convergence of periodic gossiping algorithms
- Distributed L2-gain control of large-scale systems under gossip communication protocol
This page was built for publication: Convergence rate on periodic gossiping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282871)