Complexity of model testing for dynamical systems with toric steady states
From MaRDI portal
Publication:2326902
Abstract: In this paper we investigate the complexity of model selection and model testing for dynamical systems with toric steady states. Such systems frequently arise in the study of chemical reaction networks. We do this by formulating these tasks as a constrained optimization problem in Euclidean space. This optimization problem is known as a Euclidean distance problem; the complexity of solving this problem is measured by an invariant called the Euclidean distance (ED) degree. We determine closed-form expressions for the ED degree of the steady states of several families of chemical reaction networks with toric steady states and arbitrarily many reactions. To illustrate the utility of this work we show how the ED degree can be used as a tool for estimating the computational cost of solving the model testing and model selection problems.
Recommendations
Cites work
- A comprehensive analysis of the geometry of TDOA maps in localization problems
- A global convergence result for processive multisite phosphorylation systems
- A survey of methods for deciding whether a reaction network is multistationary
- Algebraic Geometry. I: Complex projective varieties.
- Algebraic Statistics for Computational Biology
- Algebraic systems biology: a case study for the Wnt pathway
- Algorithm 795
- Cadzow denoising upgraded: a new projection method for the recovery of Dirac pulses from noisy linear measurements
- Chemical reaction systems with toric steady states
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Exact solutions in structured low-rank approximation
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- Local equations for equivariant evolutionary models
- Modeling and analysis of mass-action kinetics
- Multistationarity in sequential distributed multisite phosphorylation networks
- On best rank-\(2\) and rank-\((2,2,2)\) approximations of order-\(3\) tensors
- Polar classes of singular varieties
- Real solutions to equations from geometry
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Some approximation problems in semi-algebraic geometry
- Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
- The Euclidean distance degree of an algebraic variety
- The rational parameterisation theorem for multisite post-translational modification systems
- Toric dynamical systems
- Toric varieties
Cited in
(8)- Efficiently and effectively recognizing toricity of steady state varieties
- Defect of Euclidean distance degree
- A Morse theoretic approach to non-isolated singularities and applications to optimization
- Mathematical and Implementation Challenges Associated with Testing of the Dynamical Systems
- A numerical approach for computing Euler characteristics of affine varieties
- Euclidean distance degree and limit points in a Morsification
- Applications of singularity theory in applied algebraic geometry and algebraic statistics
- Stratification of projection maps from toric varieties
This page was built for publication: Complexity of model testing for dynamical systems with toric steady states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326902)
