Tight estimates for convergence of some non-stationary consensus algorithms
From MaRDI portal
Publication:953469
Abstract: The present paper is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some nonzero minimal weight of the information transfer along this tree is guaranteed, an estimate of the contraction rate is given. The latter is expressed explicitly as the spectral radius of some matrix depending upon the tree depth and the lower bounds on the weights.
Recommendations
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
- Convergence speed in distributed consensus and averaging
- Convergence speed in distributed consensus and averaging
- On the estimation of the consensus rate of convergence in graphs with persistent interconnections
- Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
Cites work
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 1097578 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- A Simple Approach to the Perron-Frobenius Theory for Positive Operators on General Partially-Ordered Finite-Dimensional Linear Spaces
- Convergence Rates for Markov Chains
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees
- Convergence speed in distributed consensus and averaging
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Geometric bounds for eigenvalues of Markov chains
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- On the Collatz-Wielandt numbers and the local spectral radius of a nonnegative operator
- On the second real eigenvalue of nonegative and Z-matrices
- Products of stochastic matrices and applications
- Spectral Properties of Matrices which have Invariant Cones
- Stability of leaderless discrete-time multi-agent systems
- Stability of multiagent systems with time-dependent communication links
Cited in
(11)- Generalized ratio consensus - tight bounds on convergence rate
- Adaptive control and signal processing literature survey (No. 7)
- Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights
- Optimizing the diffusion system based on continuous-time consensus algorithm
- Delayed-state-derivative feedback for improving consensus performance of second-order delayed multi-agent systems
- Exponential convergence towards consensus for non-symmetric linear first-order systems in finite and infinite dimensions
- Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds
- On the estimation of the consensus rate of convergence in graphs with persistent interconnections
- Tight bound for deciding convergence of consensus systems
- Geometric bounds for convergence rates of averaging algorithms
- Convergence and error estimates for time-discrete consensus-based optimization algorithms
This page was built for publication: Tight estimates for convergence of some non-stationary consensus algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953469)
