Consensus in non-commutative spaces
Authors: R. Sepulchre, A. Sarlette, P. Rouchon, 49th IEEE Conference on Decision and Control, pp. 6596-6601, 15-17 Dec. 2010, Atlanta, USA DOI: 10.1109/CDC.2010.5717072
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.
Download PDF
BibTeX:
@Proceedings{,
author = {R. Sepulchre, A. Sarlette, P. Rouchon},
editor = {},
title = {Consensus in non-commutative spaces},
booktitle = {49th IEEE Conference on Decision and Control},
volume = {},
publisher = {},
address = {},
pages = {6596-6601},
year = {2010},
abstract = {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.},
keywords = {}}
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.
Download PDF
BibTeX:
@Proceedings{,
author = {R. Sepulchre, A. Sarlette, P. Rouchon},
editor = {},
title = {Consensus in non-commutative spaces},
booktitle = {49th IEEE Conference on Decision and Control},
volume = {},
publisher = {},
address = {},
pages = {6596-6601},
year = {2010},
abstract = {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.},
keywords = {}}