Identifying the Parametric Occurrence of Multiple Steady States for some Biological Networks

Abstract

We consider a problem from biological network analysis of determining regions in a parameter space over which there are multiple steady states for positive real values of variables and parameters. We describe multiple approaches to address the problem using tools from Symbolic Computation. We describe how progress was made to achieve semi-algebraic descriptions of the multistationarity regions of parameter space, and compare symbolic results to numerical methods. The biological networks studied are models of the mitogen-activated protein kinases (MAPK) network which has already consumed considerable effort using special insights into its structure of corresponding models. Our main example is a model with 11 equations in 11 variables and 19 parameters, 3 of which are of interest for symbolic treatment. The model also imposes positivity conditions on all variables and parameters. We apply combinations of symbolic computation methods designed for mixed equality/inequality systems, specifically virtual substitution, lazy real triangularization and cylindrical algebraic decomposition, as well as a simplification technique adapted from Gaussian elimination and graph theory. We are able to determine multistationarity of our main example over a 2-dimensional parameter space. We also study a second MAPK model and a symbolic grid sampling technique which can locate such regions in 3-dimensional parameter space.

arXiv comment60 pages - author preprint. Accepted in the Journal of Symbolic Computation

References in corpus (12)

• Community structure in social and biological networks
• Identifying parameter regions for multistationarity
• Truth Table Invariant Cylindrical Algebraic Decomposition
• A Case Study on the Parametric Occurrence of Multiple Steady States
• Improving the use of equational constraints in cylindrical algebraic decomposition
• Using the Regular Chains Library to build cylindrical algebraic decompositions by projecting and lifting
• Using Machine Learning to Improve Cylindrical Algebraic Decomposition
• The complexity of cylindrical algebraic decomposition with respect to polynomial degree
• Understanding the Learners' Actions when using Mathematics Learning Tools
• Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks
• Cylindrical Algebraic Sub-Decompositions
• A note on "MAPK networks and their capacity for multistationarity due to toric steady states"

Cited by in corpus (14)

• Cylindrical Algebraic Decomposition with Equational Constraints
• Explainable AI Insights for Symbolic Computation: A case study on selecting the variable ordering for cylindrical algebraic decomposition
• Efficiently and Effectively Recognizing Toricity of Steady State Varieties
• Algorithmic Reduction of Biological Networks With Multiple Time Scales
• Topological descriptors of the parameter region of multistationarity: deciding upon connectivity
• Polynomial Superlevel Set Representation of the Multistationarity Region of Chemical Reaction Networks
• Improved cross-validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness
• A machine learning based software pipeline to pick the variable ordering for algorithms with polynomial inputs
• Lessons on Datasets and Paradigms in Machine Learning for Symbolic Computation: A Case Study on CAD
• The DEWCAD Project: Pushing Back the Doubly Exponential Wall of Cylindrical Algebraic Decomposition
• Jacobi Stability Analysis for Systems of ODEs Using Symbolic Computation
• Parametric Toricity of Steady State Varieties of Reaction Networks
• On the connectedness of multistationarity regions of small reaction networks
• Understanding Multistationarity of Fully Open Reaction Networks