On Metzler positive systems on hypergraphs
Shaoxuan Cui, Guofeng Zhang, Hildeberto Jard\'on-Kojakhmetov, Ming Cao

TL;DR
This paper extends Metzler matrix theory to Metzler tensors for hypergraphs, analyzing positive dynamical systems and designing control laws for stability, with applications to ecological and epidemic models.
Contribution
It introduces Metzler tensors for hypergraphs, extending matrix analysis tools to tensor-based systems, and develops control strategies for stability in these systems.
Findings
Metzler tensors characterized and their properties described.
Control laws designed to stabilize Metzler positive systems on hypergraphs.
Applications demonstrated on Lotka-Volterra and SIS epidemic models.
Abstract
In graph-theoretical terms, an edge in a graph connects two vertices while a hyperedge of a hypergraph connects any more than one vertices. If the hypergraph's hyperedges further connect the same number of vertices, it is said to be uniform. In algebraic graph theory, a graph can be characterized by an adjacency matrix, and similarly, a uniform hypergraph can be characterized by an adjacency tensor. This similarity enables us to extend existing tools of matrix analysis for studying dynamical systems evolving on graphs to the study of a class of polynomial dynamical systems evolving on hypergraphs utilizing the properties of tensors. To be more precise, in this paper, we first extend the concept of a Metzler matrix to a Metzler tensor and then describe some useful properties of such tensors. Next, we focus on positive systems on hypergraphs associated with Metzler tensors. More…
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
TopicsTensor decomposition and applications · Complex Network Analysis Techniques
MethodsFocus
