Extinction in Reaction Network Models

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Agarwal, Pranav, Craciun, Gheorghe, Deshpande, Abhishek, Jin, Jiaxin
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911373958578176
author Agarwal, Pranav
Craciun, Gheorghe
Deshpande, Abhishek
Jin, Jiaxin
author_facet Agarwal, Pranav
Craciun, Gheorghe
Deshpande, Abhishek
Jin, Jiaxin
contents In this paper, we study extinction in dynamical systems generated by reaction networks. We introduce two notions: weak extinction and strong extinction, and relate them to the structure of the underlying network through Lyapunov functions and LaSalle's invariance principle. In particular, for all deficiency-zero networks that are not weakly reversible, we provide a geometric construction of linear Lyapunov functions. Using these functions, we establish that if these networks have bounded invariant subspaces, then they must exhibit weak extinction within every such subspace. Also, for linear networks that are not weakly reversible, we show that every species outside a terminal strongly connected component undergoes strong extinction. Moreover, in order to further emphasize the difference between weak and strong extinction, we construct an example of a reaction system (based on the Ivanova network) that exhibits weak extinction for all the species, but does not exhibit strong extinction in any species.
format Preprint
id arxiv_https___arxiv_org_abs_2601_08801
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Extinction in Reaction Network Models
Agarwal, Pranav
Craciun, Gheorghe
Deshpande, Abhishek
Jin, Jiaxin
Dynamical Systems
37N25, 34D23, 34C08, 14P05, 14P10, 14Q30, 92C42
In this paper, we study extinction in dynamical systems generated by reaction networks. We introduce two notions: weak extinction and strong extinction, and relate them to the structure of the underlying network through Lyapunov functions and LaSalle's invariance principle. In particular, for all deficiency-zero networks that are not weakly reversible, we provide a geometric construction of linear Lyapunov functions. Using these functions, we establish that if these networks have bounded invariant subspaces, then they must exhibit weak extinction within every such subspace. Also, for linear networks that are not weakly reversible, we show that every species outside a terminal strongly connected component undergoes strong extinction. Moreover, in order to further emphasize the difference between weak and strong extinction, we construct an example of a reaction system (based on the Ivanova network) that exhibits weak extinction for all the species, but does not exhibit strong extinction in any species.
title Extinction in Reaction Network Models
topic Dynamical Systems
37N25, 34D23, 34C08, 14P05, 14P10, 14Q30, 92C42
url https://arxiv.org/abs/2601.08801