On the robustness of networks of heterogeneous semi-passive systems interconnected over directed graphs
Anes Lazri, Elena Panteley, Antonio Loria

TL;DR
This paper proves that networks of diverse semi-passive nonlinear systems interconnected over directed graphs with a spanning tree have bounded solutions, ensuring stability under specified conditions.
Contribution
It provides a formal proof of boundedness for heterogeneous semi-passive systems interconnected over directed graphs with minimal assumptions.
Findings
Solutions are bounded under semi-passivity and graph spanning tree conditions.
The proof applies to heterogeneous nonlinear autonomous systems.
Ensures stability of complex networked systems with directed interconnections.
Abstract
In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are semi-passive [1] and the graph contains a spanning tree.
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
TopicsMobile Ad Hoc Networks · Distributed Control Multi-Agent Systems · Mathematical and Theoretical Epidemiology and Ecology Models
