Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hilbert distance to consensus in log coordinates. Birkhoff theorem, which proves contraction of the Hilbert metric for any positive homogeneous monotone map, provides an early yet general convergence result for consensus algorithms. Because Birkhoff theorem holds in arbitrary cones, we extend consensus algorithms to the cone of positive definite matrices. The proposed generalization finds applications in the convergence analysis of quantum stochastic maps, which are a generalization of stochastic maps to non-commutative probability spaces. ©2010 IEEE
Various randomized consensus algorithms have been proposed in the literature. In some case randomnes...
The paper proposes new consensus protocols for the agreement problem in networks of agents with a di...
The present paper considers distributed consensus algorithms for agents evolving on a connected comp...
International audienceConvergence analysis of consensus algorithms is revisited in the light of the ...
The analysis of classical consensus algorithms relies on contraction properties of Markov matrices w...
This paper considers consensus problems with delayed noisy measurements, and stochastic approximatio...
This paper considers both synchronous and asynchronous consensus algorithms with noisy measurements....
Arxiv: 1302:5226The analysis of classical consensus algorithms relies on contraction properties of a...
The thesis studies the problem of consensus, considering a set of N agents locally exchanging inform...
This paper studies the coordination and consensus of networked agents in an uncertain environment. W...
This paper explores the design problem of consensus algorithms in a class of convex geometric metric...
Abstract— The convergence to consensus of all products of a given set of matrices is known to be alg...
We consider finite and infinite-dimensional first-order consensus systems with time-constant interac...
We consider a consensus algorithm in which every nodein a sequence of undirected, B-connected graphs...
We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graph...
Various randomized consensus algorithms have been proposed in the literature. In some case randomnes...
The paper proposes new consensus protocols for the agreement problem in networks of agents with a di...
The present paper considers distributed consensus algorithms for agents evolving on a connected comp...
International audienceConvergence analysis of consensus algorithms is revisited in the light of the ...
The analysis of classical consensus algorithms relies on contraction properties of Markov matrices w...
This paper considers consensus problems with delayed noisy measurements, and stochastic approximatio...
This paper considers both synchronous and asynchronous consensus algorithms with noisy measurements....
Arxiv: 1302:5226The analysis of classical consensus algorithms relies on contraction properties of a...
The thesis studies the problem of consensus, considering a set of N agents locally exchanging inform...
This paper studies the coordination and consensus of networked agents in an uncertain environment. W...
This paper explores the design problem of consensus algorithms in a class of convex geometric metric...
Abstract— The convergence to consensus of all products of a given set of matrices is known to be alg...
We consider finite and infinite-dimensional first-order consensus systems with time-constant interac...
We consider a consensus algorithm in which every nodein a sequence of undirected, B-connected graphs...
We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graph...
Various randomized consensus algorithms have been proposed in the literature. In some case randomnes...
The paper proposes new consensus protocols for the agreement problem in networks of agents with a di...
The present paper considers distributed consensus algorithms for agents evolving on a connected comp...