Communications in Mathematical Sciences

Graph-theoretic approaches to injectivity and multiple equilibria in systems of interacting elements

Murad Banaji and Gheorghe Craciun
Source: Commun. Math. Sci. Volume 7, Number 4 (2009), 867-900.

Abstract

We extend previous work on injectivity in chemical reaction networks to general interaction networks. Matrix- and graph-theoretic conditions for injectivity of these systems are presented. A particular signed, directed, labelled, bipartite multigraph, termed the “DSR graph”, is shown to be a useful representation of an interaction network when discussing questions of injectivity. A graph-theoretic condition, developed previously in the context of chemical reaction networks, is shown to be sufficient to guarantee injectivity for a large class of systems. The graph-theoretic condition is simple to state and often easy to check. Examples are presented to illustrate the wide applicability of the theory developed.

First Page: Show Hide
Primary Subjects: 05C50, 05C38, 34C99, 15A15
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.cms/1264434136
Zentralblatt MATH identifier: 05685822
Mathematical Reviews number (MathSciNet): MR2604624


2012 © International Press of Boston

Communications in Mathematical Sciences

Communications in Mathematical Sciences