Searcharxiv⌕ Search

arXiv subjects

Carsten Wiuf

Publications and source records attributed to Carsten Wiuf.

At least 37 records · Page 2Linked to original sources

Addition of flow reactions preserving multistationarity and bistability

We consider the question whether a chemical reaction network preserves the number and stability of its positive steady states upon inclusion of inflow and outflow reactions. Often a model of a reaction network is presented without inflows and outflows, while in fact some of the species might be degraded or leaked to the environment, or be synthesized or transported into the system. We provide a sufficient and easy-to-check criterion based on the stoichiometry of the reaction network alone and discuss examples from systems biology.

q-bio.MN↗

Long-time asymptotics of stochastic reaction systems

We study the stochastic dynamics of a system of interacting species in a stochastic environment by means of a continuous-time Markov chain with transition rates depending on the state of the environment. Models of gene regulation in systems biology take this form. We characterise the finite-time distribution of the Markov chain, provide conditions for ergodicity, and characterise the stationary distribution (when it exists) as a mixture of Poisson distributions. The mixture measure is uniquely identified as the law of a fixed point of a stochastic recurrence equation. This recursion is crucial for statistical computation of moments and other distributional features.

math.DS↗

Quasi-steady state and singular perturbation reduction for reaction networks with non-interacting species

Quasi-steady state (QSS) reduction is a commonly used method to lower the dimension of a differential equation model of a chemical reaction network. From a mathematical perspective, QSS reduction is generally interpreted as a special type of singular perturbation reduction, but in many instances the correspondence is not worked out rigorously, and the QSS reduction may yield incorrect results. The present paper contains a thorough discussion of QSS reduction and its relation to singular perturbation reduction for the special, but important, case when the right hand side of the differential equation is linear in the variables to be eliminated. For this class we give necessary and sufficient conditions for a singular perturbation reduction (in the sense of Tikhonov and Fenichel) to exist, and to agree with QSS reduction. We then apply the general results to chemical reaction networks with non-interacting species, generalizing earlier results and methods for steady states to quasi-steady state scenarios. We provide easy-to-check graphical conditions to select parameter values yielding to singular perturbation reductions and additionally, we identify a choice of parameters for which the corresponding singular perturbation reduction agrees with the QSS reduction. Finally we consider a number of examples.

math.DS↗

A reaction network scheme which implements inference and learning for Hidden Markov Models

With a view towards molecular communication systems and molecular multi-agent systems, we propose the Chemical Baum-Welch Algorithm, a novel reaction network scheme that learns parameters for Hidden Markov Models (HMMs). Each reaction in our scheme changes only one molecule of one species to one molecule of another. The reverse change is also accessible but via a different set of enzymes, in a design reminiscent of futile cycles in biochemical pathways. We show that every fixed point of the Baum-Welch algorithm for HMMs is a fixed point of our reaction network scheme, and every positive fixed point of our scheme is a fixed point of the Baum-Welch algorithm. We prove that the "Expectation" step and the "Maximization" step of our reaction network separately converge exponentially fast. We simulate mass-action kinetics for our network on an example sequence, and show that it learns the same parameters for the HMM as the Baum-Welch algorithm.

cs.ET↗

A proof of unlimited multistability for phosphorylation cycles

The multiple futile cycle is a phosphorylation system in which a molecular substrate might be phosphorylated sequentially n times by means of an enzymatic mechanism. The system has been studied mathematically using reaction network theory and ordinary differential equations. It is known that the system might have at least as many as 2[n/2]+1 steady states (where [x] is the integer part of x) for particular choices of parameters. Furthermore, for the simple and dual futile cycles (n=1,2) the stability of the steady states has been determined in the sense that the only steady state of the simple futile cycle is globally stable, while there exist parameter values for which the dual futile cycle admits two asymptotically stable and one unstable steady state. For general n, evidence that the possible number of asymptotically stable steady states increases with $n$ has been given, which has led to the conjecture that parameter values can be chosen such that [n/2]+1 out of 2[n/2]+1 steady states are asymptotically stable and the remaining steady states are unstable. We prove this conjecture here by first reducing the system to a smaller one, for which we find a choice of parameter values that give rise to a unique steady state with multiplicity 2[n/2]+1. Using arguments from geometric singular perturbation theory, and a detailed analysis of the centre manifold of this steady state, we achieve the desired result.

q-bio.MN↗

Existence of a Unique Quasi-stationary Distribution for Stochastic Reaction Networks

In the setting of stochastic dynamical systems that eventually go extinct, the quasi-stationary distributions are useful to understand the long-term behavior of a system before evanescence. For a broad class of applicable continuous-time Markov processes on countably infinite state spaces, known as reaction networks, we introduce the inferred notion of absorbing and endorsed sets, and obtain sufficient conditions for the existence and uniqueness of a quasi-stationary distribution within each such endorsed set. In particular, we obtain sufficient conditions for the existence of a globally attracting quasi-stationary distribution in the space of probability measures on the set of endorsed states. Furthermore, under these conditions, the convergence from any initial distribution to the quasi-stationary distribution is exponential in the total variation norm.

math.PR↗

General theory for stochastic admixture graphs and F-statistics

We provide a general mathematical framework based on the theory of graphical models to study admixture graphs. Admixture graphs are used to describe the ancestral relationships between past and present populations, allowing for population merges and migration events, by means of gene flow. We give various mathematical properties of admixture graphs with particular focus on properties of the so-called $F$-statistics. Also the Wright-Fisher model is studied and a general expression for the loss of heterozygosity is derived.

q-bio.PE↗

Nonnegative linear elimination for chemical reaction networks

We consider linear elimination of variables in steady state equations of a chemical reaction network. Particular subsets of variables corresponding to sets of so-called reactant-noninteracting species, are introduced. The steady state equations for the variables in such a set, taken together with potential linear conservation laws in the variables, define a linear system of equations. We give conditions that guarantee that the solution to this system is nonnegative, provided it is unique. The results are framed in terms of spanning forests of a particular multidigraph derived from the reaction network and thereby conditions for uniqueness and nonnegativity of a solution are derived by means of the multidigraph. Though our motivation comes from applications in systems biology, the results have general applicability in applied sciences.

q-bio.MN↗

Node Balanced Steady States: Unifying and Generalizing Complex and Detailed Balanced Steady States

We introduce a unifying and generalizing framework for complex and detailed balanced steady states in chemical reaction network theory. To this end, we generalize the graph commonly used to represent a reaction network. Specifically, we introduce a graph, called a reaction graph, that has one edge for each reaction but potentially multiple nodes for each complex. A special class of steady states, called node balanced steady states, is naturally associated with such a reaction graph. We show that complex and detailed balanced steady states are special cases of node balanced steady states by choosing appropriate reaction graphs. Further, we show that node balanced steady states have properties analogous to complex balanced steady states, such as uniqueness and asymptotical stability in each stoichiometric compatibility class. Moreover, we associate an integer, called the deficiency, to a reaction graph that gives the number of independent relations in the reaction rate constants that need to be satisfied for a positive node balanced steady state to exist. The set of reaction graphs (modulo isomorphism) is equipped with a partial order that has the complex balanced reaction graph as minimal element. We relate this order to the deficiency and to the set of reaction rate constants for which a positive node balanced steady state exists.

math.DS↗

Uniform Approximation of Solutions by Elimination of Intermediate Species in Deterministic Reaction Networks

Chemical reactions often proceed through the formation and the consumption of intermediate species. An example is the creation and subsequent degradation of the substrate-enzyme complexes in an enzymatic reaction. In this paper we provide a setting, based on ordinary differential equations, in which the presence of intermediate species has little effect on the overall dynamics of a biological system. The result provides a method to perform model reduction by elimination of intermediate species. We study the problem in a multiscale setting, where the species abundances as well a the reaction rates scale to different orders of magnitudes. The different time and concentration scales are parameterised by a single parameter $N$. We show that a solution to the original reaction system is uniformly approximated on compact time intervals to a solution of a reduced reaction system without intermediates and to a solution of a certain limiting reaction systems, which does not depend on $N$. Known approximation techniques such as the theorems by Tikhonov and Fenichel cannot readily be used in this framework.

math.DS↗

Graphical criteria for positive solutions to linear systems

We study linear systems of equations with coefficients in a generic partially ordered ring $R$ and a unique solution, and seek conditions for the solution to be nonnegative, that is, every component of the solution is a quotient of two nonnegative elements in $R$. The requirement of a nonnegative solution arises typically in applications, such as in biology and ecology, where quantities of interest are concentrations and abundances. We provide novel conditions on a labeled multidigraph associated with the linear system that guarantee the solution to be nonnegative. Furthermore, we study a generalization of the first class of linear systems, where the coefficient matrix has a specific block form and provide analogous conditions for nonnegativity of the solution, similarly based on a labeled multidigraph. The latter scenario arises naturally in chemical reaction network theory, when studying full or partial parameterizations of the positive part of the steady state variety of a polynomial dynamical system in the concentrations of the molecular species.

math.AG↗

Identifying parameter regions for multistationarity

Mathematical modelling has become an established tool for studying the dynamics of biological systems. Current applications range from building models that reproduce quantitative data to identifying systems with predefined qualitative features, such as switching behaviour, bistability or oscillations. Mathematically, the latter question amounts to identifying parameter values associated with a given qualitative feature. We introduce a procedure to partition the parameter space of a parameterized system of ordinary differential equations into regions for which the system has a unique or multiple equilibria. The procedure is based on the computation of the Brouwer degree, and it creates a multivariate polynomial with parameter depending coefficients. The signs of the coefficients determine parameter regions with and without multistationarity. A particular strength of the procedure is the avoidance of numerical analysis and parameter sampling. The procedure consists of a number of steps. Each of these steps might be addressed algorithmically using various computer programs and available software, or manually. We demonstrate our procedure on several models of gene transcription and cell signalling, and show that in many cases we obtain a complete partitioning of the parameter space with respect to multistationarity.

q-bio.MN↗

Intermediates and Generic Convergence to Equilibria

Known graphical conditions for the generic or global convergence to equilibria of the dynamical system arising from a reaction network are shown to be invariant under the so-called successive removal of intermediates, a systematic procedure to simplify the network, making the graphical conditions easier to check.

math.DS↗

Intermediates, Catalysts, Persistence, and Boundary Steady States

For dynamical systems arising from chemical reaction networks, persistence is the property that each species concentration remains positively bounded away from zero, as long as species concentrations were all positive in the beginning. We describe two graphical procedures for simplifying reaction networks without breaking known necessary or sufficient conditions for persistence, by iteratively removing so-called intermediates and catalysts from the network. The procedures are easy to apply and, in many cases, lead to highly simplified network structures, such as monomolecular networks. For specific classes of reaction networks, we show that these conditions for persistence are equivalent to one another. Furthermore, they can also be characterized by easily checkable strong connectivity properties of a related graph. In particular, this is the case for (conservative) monomolecular networks, as well as cascades of a large class of post-translational modification systems (of which the MAPK cascade and the $n$-site futile cycle are prominent examples). Since one of the aforementioned sufficient conditions for persistence precludes the existence of boundary steady states, our method also provides a graphical tool to check for that.

math.DS↗

Graphical reduction of reaction networks by linear elimination of species

The quasi-steady state approximation and time-scale separation are commonly applied methods to simplify models of biochemical reaction networks based on ordinary differential equations (ODEs). The concentrations of the "fast" species are assumed effectively to be at steady state with respect to the "slow" species. Under this assumption the steady state equations can be used to eliminate the "fast" variables and a new ODE system with only the slow species can be obtained. We interpret a reduced system obtained by time-scale separation as the ODE system arising from a unique reaction network, by identification of a set of reactions and the corresponding rate functions. The procedure is graphically based and can easily be worked out by hand for small networks. For larger networks, we provide a pseudo-algorithm. We study properties of the reduced network, its kinetics and conservation laws, and show that the kinetics of the reduced network fulfil realistic assumptions, provided the original network does. We illustrate our results using biological examples such as substrate mechanisms, post-translational modification systems and networks with intermediates (transient) steps.

math.DS↗

Product-form Poisson-like distributions and complex balanced reaction systems

Stochastic reaction networks are dynamical models of biochemical reaction systems and form a particular class of continuous-time Markov chains on $\mathbb{N}^n$. Here we provide a fundamental characterisation that connects structural properties of a network to its dynamical features. Specifically, we define the notion of `stochastically complex balanced systems' in terms of the network's stationary distribution and provide a characterisation of stochastically complex balanced systems, parallel to that established in the 70-80ies for deterministic reaction networks. Additionally, we establish that a network is stochastically complex balanced if and only if an associated deterministic network is complex balanced (in the deterministic sense), thereby proving a strong link between the theory of stochastic and deterministic networks. Further, we prove a stochastic version of the `deficiency zero theorem' and show that any (not only complex balanced) deficiency zero reaction network has a product-form Poisson-like stationary distribution on all irreducible components. Finally, we provide sufficient conditions for when a product-form Poisson-like distribution on a single (or all) component(s) implies the network is complex balanced, and explore the possibility to characterise complex balanced systems in terms of product-form Poisson-like stationary distributions.

math.PR↗

Elimination of Intermediate Species in Multiscale Stochastic Reaction Networks

We study networks of biochemical reactions modelled by continuous-time Markov processes. Such networks typically contain many molecular species and reactions and are hard to study analytically as well as by simulation. Particularly, we are interested in reaction networks with intermediate species such as the substrate-enzyme complex in the Michaelis-Menten mechanism. These species are virtually in all real-world networks, they are typically short-lived, degraded at a fast rate and hard to observe experimentally. We provide conditions under which the Markov process of a multiscale reaction network with intermediate species is approximated in finite dimensional distribution by the Markov process of a simpler reduced reaction network without intermediate species. We do so by embedding the Markov processes into a one-parameter family of processes, where reaction rates and species abundances are scaled in the parameter. Further, we show that there are close links between these stochastic models and deterministic ODE models of the same networks.

q-bio.MN↗

Simplifying Biochemical Models With Intermediate Species

Mathematical models are increasingly being used to understand complex biochemical systems, to analyze experimental data and make predictions about unobserved quantities. However, we rarely know how robust our conclusions are with respect to the choice and uncertainties of the model. Using algebraic techniques we study systematically the effects of intermediate, or transient, species in biochemical systems and provide a simple, yet rigorous mathematical classification of all models obtained from a core model by including intermediates. Main examples include enzymatic and post-translational modification systems, where intermediates often are considered insignificant and neglected in a model, or they are not included because we are unaware of their existence. All possible models obtained from the core model are classified into a finite number of classes. Each class is defined by a mathematically simple canonical model that characterizes crucial dynamical properties, such as mono- and multistationarity and stability of steady states, of all models in the class. We show that if the core model does not have conservation laws, then the introduction of intermediates does not change the steady-state concentrations of the species in the core model, after suitable matching of parameters. Importantly, our results provide guidelines to the modeler in choosing between models and in distinguishing their properties. Further, our work provides a formal way of comparing models that share a common skeleton.

q-bio.MN↗