Algorithmic Reduction of Biological Networks with Multiple Time Scales
Résumé
We present a symbolic algorithmic approach that allows to compute invariant manifolds and corresponding reduced systems for differential equations modeling biological networks which comprise chemical reaction networks for cellular biochemistry, and compartmental models for pharmacology, epidemiology and ecology. Multiple time scales of a given network are obtained by scaling, based on tropical geometry. Our reduction is mathematically justified within a singular perturbation setting. The existence of invariant manifolds is subject to hyperbolicity conditions, for which we propose an algorithmic test based on Hurwitz criteria. We finally obtain a sequence of nested invariant manifolds and respective reduced systems on those manifolds. Our theoretical results are generally accompanied by rigorous algorithmic descriptions suitable for direct implementation based on existing off-theshelf software systems, specifically symbolic computation libraries and Satisfiability Modulo Theories solvers. We present computational examples taken from the well-known BioModels database using our own prototypical implementations.
Mots clés
Chemical reaction network
Compartmental model
Dimension reduction
Invariant set
Logic computation
Multiple time scales
Polynomial differential equations
Real algebraic computation
Satisfiability modulo theories
Singular perturbation
Symbolic computation
Tropical geometry Mathematics Subject Classification Primary 68W30
Secondary 14P10
34E15
37D10
92C45
Fichier principal
Kruff2021_Article_AlgorithmicReductionOfBiologic.pdf (1.1 Mo)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|