A consensus algorithm in CAT(0) space and its application to distributed fusion of phylogenetic trees.

Based on convex analysis, a novel consensus algorithm of dynamical points in a CAT(0) space is developed in this paper, in which the associated communication graph uniformly contains a directed spanning tree. The proposed algorithm provides an efficient method of solving consensus problems in a general CAT(0) space, while having certain robustness against weak communication. The application of the new algorithm to the distributed fusion of phylogenetic trees is shown with demonstrative-case simulations, together with a study on the algorithm's robustness and efficiency. [ABSTRACT FROM AUTHOR]