Tropical Algebraic approach to Consensus over Networks

Abstract

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.

References in corpus (2)

• Emergence of scaling in random networks
• Novel type of phase transition in a system of self-driven particles