Dynamical properties of Discrete Reaction Networks

• Published in: Journal of mathematical biology Vol. 69; no. 1; pp. 55 - 72
• Main Authors: Paulevé, Loïc, Craciun, Gheorghe, Koeppl, Heinz
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2014; Springer Nature B.V; Springer
• Subjects: Applications of Mathematics; Circadian Clocks; Combinatorics; Kinetics; Mathematical and Computational Biology; Mathematics; Mathematics and Statistics; Models, Biological; Models, Chemical; Phosphorylation; Stochastic Processes; 92C45; 92C42; 92D25; 37N25; 80A30; recurrence; irreducibility; discrete dynamics; infinite transition systems; biochemical networks
• ISSN: 0303-6812; 1432-1416
• DOI: 10.1007/s00285-013-0686-2

Reaction networks are commonly used to model the dynamics of populations subject to transformations that follow an imposed stoichiometry. This paper focuses on the efficient characterisation of dynamical properties of Discrete Reaction Networks (DRNs). DRNs can be seen as modeling the underlying discrete nondeterministic transitions of stochastic models of reaction networks. In that sense, a proof of non-reachability in a given DRN has immediate implications for any concrete stochastic model based on that DRN, independent of the choice of kinetic laws and constants. Moreover, if we assume that stochastic kinetic rates are given by the mass-action law (or any other kinetic law that gives non-vanishing probability to each reaction if the required number of interacting substrates is present), then reachability properties are equivalent in the two settings. The analysis of two types of global dynamical properties of DRNs is addressed: irreducibility , i.e., the ability to reach any discrete state from any other state; and recurrence , i.e., the ability to return to any initial state. Our results consider both the verification of such properties when species are present in a large copy number, and in the general case. The necessary and sufficient conditions obtained involve algebraic conditions on the network reactions which in most cases can be verified using linear programming. Finally, the relationship of DRN irreducibility and recurrence with dynamical properties of stochastic and continuous models of reaction networks is discussed.