Tropical Algebraic approach to Consensus over Networks

2011/09/02 by Joel George Manathara, Manathara, Joel George, Ambedkar Dukkipati +2
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #Distributed Control Multi-Agent Systems #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Opinion Dynamics and Social Influence #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.1109.0418

openalex publication_date 2011/09/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Consensus and Cooperation in Networked Multi-Agent Systems

Related

• On Consensus under Polynomial Protocols
• Distributed finite-time termination for consensus algorithm in switching topologies
• Critical Connectivity and Fastest Convergence Rates of Distributed Consensus with Switching Topologies and Additive Noises
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Scaled Consensus Problems on Switching Networks