OCDMSYSYSep 2, 2011

Tropical Algebraic approach to Consensus over Networks

arXiv:1109.04182 citationsh-index: 37

Analysis pending

In this paper we study the convergence of the max-consensus protocol. Tropical algebra is used to formulate the problem. Necessary and sufficient conditions for convergence of the max-consensus protocol over fixed as well as switching topology networks are given.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes