Graph-theoretic conditions for zero-eigenvalue Turing instability in general chemical reaction networks
Related Experiment Video
Updated: May 9, 2026

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
Published on: November 25, 2015
Maya Mincheva1, Gheorghe Craciun
1Department of Mathematical Sciences, Northern Illinois University, Dekalb, IL 60115, United States. mincheva@math.niu.edu
Abstract:
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.
Related Concept Videos
Dynamic Equilibrium
Transition State Theory
Stability of Equilibrium Configuration
A stable equilibrium occurs when a system tends to return to its original position when given a small displacement, and the potential energy is at its minimum. An example of a stable equilibrium is when a cantilever beam is fixed at one end and a weight is attached to the other end. If the weight...
Half-life of a Reaction
Energy Diagrams, Transition States, and Intermediates
Free Energy Changes for Nonstandard States
