Tropical Algebraic approach to Consensus over Networks
Joel George Manathara, Ambedkar Dukkipati, Dabasish Ghose
TL;DR
This paper uses tropical algebra to analyze the convergence of max-consensus protocols in networked systems, providing precise conditions for both fixed and switching topologies.
Contribution
It introduces a novel tropical algebraic framework to determine convergence conditions for max-consensus protocols in various network topologies.
Findings
Derived necessary and sufficient conditions for convergence.
Applied tropical algebra to fixed and switching network topologies.
Enhanced understanding of consensus dynamics in networked systems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Distributed Control Multi-Agent Systems · Opinion Dynamics and Social Influence