Searcharxiv⌕ Search

arXiv subjects

Murad Banaji

Publications and source records attributed to Murad Banaji.

28 records · Page 2Linked to original sources
arXiv2013

Local and global stability of equilibria for a class of chemical reaction networks

A class of chemical reaction networks is described with the property that each positive equilibrium is locally asymptotically stable relative to its stoichiometry class, an invariant subspace on which it lies. The reaction systems treated are characterised primarily by the existence of a certain factorisation of their stoichiometric matrix, and strong connectedness of an associated graph. Only very mild assumptions are made about the rates of reactions, and in particular, mass action kinetics are not assumed. In many cases, local asymptotic stability can be extended to global asymptotic stability of each positive equilibrium relative to its stoichiometry class. The results are proved via the construction of Lyapunov functions whose existence follows from the fact that the reaction networks define monotone dynamical systems with increasing integrals.

math.DS↗
arXiv2013

A graph-theoretic condition for irreducibility of a set of cone preserving matrices

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.

math.CO↗
arXiv2010

Cycle structure in SR and DSR graphs: implications for multiple equilibria and stable oscillation in chemical reaction networks

Associated with a chemical reaction network is a natural labelled bipartite multigraph termed an SR graph, and its directed version, the DSR graph. These objects are closely related to Petri nets. The construction of SR and DSR graphs for chemical reaction networks is presented. Conclusions about asymptotic behaviour of the associated dynamical systems which can be drawn easily from the graphs are discussed. In particular, theorems on ruling out the possibility of multiple equilibria or stable oscillation in chemical reaction networks based on computations on SR/DSR graphs are presented. These include both published and new results. The power and limitations of such results are illustrated via several examples.

math.DS↗
arXiv2010

P-matrices and signed digraphs

We associate a signed digraph with a list of matrices whose dimensions permit them to be multiplied, and whose product is square. Cycles in this graph have a parity, that is, they are either even (termed e-cycles) or odd (termed o-cycles). The absence of e-cycles in the graph is shown to imply that the matrix product is a P0-matrix, i.e., all of its principal minors are nonnegative. Conversely, the presence of an e-cycle is shown to imply that there exists a list of matrices associated with the graph whose product fails to be a P0-matrix. The results generalise a number of previous results relating P- and P0-matrices to graphs.

math.CO↗
arXiv2010

Graph-theoretic conditions for injectivity of functions on rectangular domains

This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and flows. Well-known results on systems with signed Jacobians are shown to be easy corollaries of more general results presented here.

math.FA↗
arXiv2009

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

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.

math.DS↗
arXiv2009

Graph-theoretic criteria for injectivity and unique equilibria in general chemical reaction systems

In this paper we discuss the question of how to decide when a general chemical reaction system is incapable of admitting multiple equilibria, regardless of parameter values such as reaction rate constants, and regardless of the type of chemical kinetics, such as mass-action kinetics, Michaelis-Menten kinetics, etc. Our results relate previously described linear algebraic and graph-theoretic conditions for injectivity of chemical reaction systems. After developing a translation between the two formalisms, we show that a graph-theoretic test developed earlier in the context of systems with mass action kinetics, can be applied to reaction systems with arbitrary kinetics. The test, which is easy to implement algorithmically, and can often be decided without the need for any computation, rules out the possibility of multiple equilibria for the systems in question.

math.DS↗
arXiv2009

Convergence in strongly monotone systems with an increasing first integral

In this paper we generalise a useful result due to J. Mierczynski which states that for a strictly cooperative system on the positive orthant, with increasing first integral, all bounded orbits are convergent. Moreover any equilibrium attracts its entire level set, and there can be no more than one equilibrium on any level set. Here, more general state spaces and more general orderings are considered. Let Y subset K subset R^n be any two proper cones. Given a local semiflow phi on Y which is strongly monotone with respect to K, and which preserves a K-increasing first integral, we show that every bounded orbit converges. Again, each equilibrium attracts its entire level set, and there can be no more than one equilibrium on any level set. An application from chemical dynamics is provided.

math.DS↗
arXiv2007

Stability in generic mitochondrial models

In this paper, we use a variety of mathematical techniques to explore existence, local stability, and global stability of equilibria in abstract models of mitochondrial metabolism. The class of models constructed is defined by the biological description of the system, with minimal mathematical assumptions. The key features are an electron transport chain coupled to a process of charge translocation across a membrane. In the absence of charge translocation these models have previously been shown to behave in a very simple manner with a single, globally stable equilibrium. We show that with charge translocation the conclusion about a unique equilibrium remains true, but local and global stability do not necessarily follow. In sufficiently low dimensions - i.e. for short electron transport chains - it is possible to make claims about local and global stability of the equilibrium. On the other hand, for longer chains, these general claims are no longer valid. Some particular conditions which ensure stability of the equilibrium for chains of arbitrary length are presented.

q-bio.QM↗