  Positivity and Perron-Frobenius theory provide an elegant framework for the
convergence analysis of linear consensus algorithms. Here we consider a
generalization of these ideas to the analysis of nonlinear consensus algorithms
on the circle and establish tools for the design of consensus protocols that
monotonically converge to target formations on the circle.
