Graph-theoretic conditions for zero-eigenvalue Turing instability in general chemical reaction networks

We describe a necessary condition for zero-eigenvalue Turing instability, i.e., Turing instability arising from a real eigenvalue changing sign from negative to positive, for general chemical reaction networks modeled with mass-action kinetics. The reaction mechanisms are represented by the spec...

Full description

Saved in:
Bibliographic Details
Main Authors: Maya Mincheva, Gheorghe Craciun
Format: Article
Language:English
Published: AIMS Press 2013-05-01
Series:Mathematical Biosciences and Engineering
Subjects:
Online Access:https://www.aimspress.com/article/doi/10.3934/mbe.2013.10.1207
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe a necessary condition for zero-eigenvalue Turing instability, i.e., Turing instability arising from a real eigenvalue changing sign from negative to positive, for general chemical reaction networks modeled with mass-action kinetics. The reaction mechanisms are represented by the species-reaction graph (SR graph), which is a bipartite graph with different nodes representing species and reactions. If the SR graph satisfies certain conditions, similar to the conditions for ruling out multiple equilibria in spatially homogeneous differential equations systems, then the corresponding mass-action reaction-diffusion system cannot exhibit zero-eigenvalue Turing instability for any parameter values.On the other hand, if the graph-theoretic condition for ruling out zero-eigenvalue Turing instability is not satisfied, then the corresponding model may display zero-eigenvalue Turing instability for some parameter values. The technique is illustrated with a model of a bifunctional enzyme.
ISSN:1551-0018