A computational approach to the structural analysis of uncertain kinetic systems
From MaRDI portal
Publication:2102477
Abstract: A computation-oriented representation of uncertain kinetic systems is introduced and analysed in this paper. It is assumed that the monomial coefficients of the ODEs belong to a polytopic set, which defines a set of dynamical systems for an uncertain model. An optimization-based computation model is proposed for the structural analysis of uncertain models. It is shown that the so-called dense realization containing the maximum number of reactions (directed edges) is computable in polynomial time, and it forms a super-structure among all the possible reaction graphs corresponding to an uncertain kinetic model, assuming a fixed set of complexes. The set of core reactions present in all reaction graphs of an uncertain model is also studied. Most importantly, an algorithm is proposed to compute all possible reaction graph structures for an uncertain kinetic model.
Recommendations
- A new efficient algorithm for determining all structurally different realizations of kinetic systems
- Realization of linearly conjugate and uncertain kinetic systems with time delay
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
- Reaction network realizations of rational biochemical systems and their structural properties
- Computing all sparse kinetic structures for a Lorenz system using optimization
Cites work
- scientific article; zbMATH DE number 44637 (Why is no real title available?)
- scientific article; zbMATH DE number 3795757 (Why is no real title available?)
- scientific article; zbMATH DE number 896049 (Why is no real title available?)
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- A new efficient algorithm for determining all structurally different realizations of kinetic systems
- A probabilistic algorithm to test local algebraic observability in polynomial time
- A proof of the global attractor conjecture in the single linkage class case
- An algorithm for finding globally identifiable parameter combinations of nonlinear ODE models using Gröbner bases
- An interval approach for dealing with flux distributions and elementary modes activity patterns
- Compartmental models with uncertain flow rates
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
- Computing linearly conjugate weakly reversible kinetic structures using optimization and graph theory
- Computing sparse and dense realizations of reaction kinetic systems
- Computing weakly reversible linearly conjugate chemical reaction networks with minimal defi\-ciency
- Computing zero deficiency realizations of kinetic systems
- Decision making: uncertainty, imperfection, deliberation and scalability. Extended versions of six selected contributions based on the presentations at the workshop ``Scalable decision making: uncertainty, imperfection, deliberation, Prague, Czech Republic, 2013
- Dynamical equivalence and linear conjugacy of chemical reaction networks: new results and methods
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- Identifiability of chemical reaction networks
- Identifiable reparametrizations of linear compartment models
- Identification of parametric models from experimental data. Transl. from an upd. French version by the authors, with the help of John Norton
- Linear Matrix Inequalities in System and Control Theory
- Linear conjugacy of chemical reaction networks
- Modeling and analysis of mass-action kinetics
- Nonnegative and compartmental dynamical systems
- On Stability and Trajectory Boundedness of Lotka–Volterra Systems With Polytopic Uncertainty
- On global identifiability for arbitrary model parametrizations
- On the identifiability and distinguishability of nonlinear parametric models
- On the relationship between sloppiness and identifiability
- Robust Stabilization for Single-Input Polytopic Nonlinear Systems
- Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
- Uncertainty. The soul of modeling, probability and statistics
Cited in
(7)- Realizations of kinetic differential equations
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- Guaranteed and randomized methods for stability analysis of uncertain metabolic networks
- Polynomial time reachability analysis in discrete state chemical reaction networks obeying conservation laws
- Computing all sparse kinetic structures for a Lorenz system using optimization
- Realization of linearly conjugate and uncertain kinetic systems with time delay
- Polynomial time coverability analysis in discrete state chemical reaction network subclasses
This page was built for publication: A computational approach to the structural analysis of uncertain kinetic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102477)
