A graph-theoretic condition for irreducibility of a set of cone preserving matrices
From MaRDI portal
(Redirected from Publication:389682)
Abstract: Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and the main result is relevant to applications in biology and chemistry. Several examples are presented.
Recommendations
Cites work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 758785 (Why is no real title available?)
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- scientific article; zbMATH DE number 2247510 (Why is no real title available?)
- A graph theoretic approach to strong monotonicity with respect to polyhedral cones
- Global convergence in systems of differential equations arising from chemical reaction networks
- Graph-theoretic approaches to injectivity and multiple equilibria in systems of interacting elements
- Graphs and irreducible cone preserving maps
- Graphs for cone preserving maps
- Monotonicity in chemical reaction systems
- Spectral Properties of Matrices which have Invariant Cones
- Systems of Differential Equations that are Competitive or Cooperative II: Convergence Almost Everywhere
- The lattice of faces of a finite dimensional cone
- \(P\)-matrices and signed digraphs
Cited in
(2)
This page was built for publication: A graph-theoretic condition for irreducibility of a set of cone preserving matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389682)