Reaction networks are mainly used to model the time-evolution of molecules of interacting chemical species. Stochastic models are typically used when the counts of the molecules are low, whereas deterministic models are often used when the counts are in high abundance. The mathematical study of reaction networks has increased dramatically over the last two decades as these models are now routinely used to investigate cellular behavior. In 2011, the notion of “tiers” was introduced to study the long time behavior of deterministically modeled reaction networks that are weakly reversible and have a single linkage class. This “tier” based argument was analytical in nature. Later, in 2014, the notion of a strongly endotactic network was introduced in order to generalize the previous results from weakly reversible networks with a single linkage class to this wider family of networks. The point of view of this later work was more geometric and algebraic in nature. The notion of strongly endotactic networks was later used in 2018 to prove a large deviation principle for a class of stochastically modeled reaction networks. In the current paper we provide an analytical characterization of strongly endotactic networks in terms of tier structures. By doing so, we not only shed light on the connection between the two points of view, but also make available a new proof technique for the study of strongly endotactic networks. We show the power of this new technique in two distinct ways. First, we demonstrate how the main previous results related to strongly endotactic networks, both for the deterministic and stochastic modeling choices, can be quickly obtained from our characterization. Second, we demonstrate how new results can be obtained by proving that a sub-class of strongly endotactic networks, when modeled stochastically, is positive recurrent. Finally, and similarly to recent independent work by Agazzi and Mattingly, we provide an example which closes a conjecture in the negative by showing that stochastically modeled strongly endotactic networks can be transient (and even explosive).

Tier structure of strongly endotactic reaction networks / Anderson, D. F.; Cappelletti, D.; Kim, J.; Nguyen, T. D.. - In: STOCHASTIC PROCESSES AND THEIR APPLICATIONS. - ISSN 0304-4149. - STAMPA. - 130:12(2020), pp. 7218-7259. [10.1016/j.spa.2020.07.012]

Tier structure of strongly endotactic reaction networks

Cappelletti D.;
2020

Abstract

Reaction networks are mainly used to model the time-evolution of molecules of interacting chemical species. Stochastic models are typically used when the counts of the molecules are low, whereas deterministic models are often used when the counts are in high abundance. The mathematical study of reaction networks has increased dramatically over the last two decades as these models are now routinely used to investigate cellular behavior. In 2011, the notion of “tiers” was introduced to study the long time behavior of deterministically modeled reaction networks that are weakly reversible and have a single linkage class. This “tier” based argument was analytical in nature. Later, in 2014, the notion of a strongly endotactic network was introduced in order to generalize the previous results from weakly reversible networks with a single linkage class to this wider family of networks. The point of view of this later work was more geometric and algebraic in nature. The notion of strongly endotactic networks was later used in 2018 to prove a large deviation principle for a class of stochastically modeled reaction networks. In the current paper we provide an analytical characterization of strongly endotactic networks in terms of tier structures. By doing so, we not only shed light on the connection between the two points of view, but also make available a new proof technique for the study of strongly endotactic networks. We show the power of this new technique in two distinct ways. First, we demonstrate how the main previous results related to strongly endotactic networks, both for the deterministic and stochastic modeling choices, can be quickly obtained from our characterization. Second, we demonstrate how new results can be obtained by proving that a sub-class of strongly endotactic networks, when modeled stochastically, is positive recurrent. Finally, and similarly to recent independent work by Agazzi and Mattingly, we provide an example which closes a conjecture in the negative by showing that stochastically modeled strongly endotactic networks can be transient (and even explosive).
File in questo prodotto:
File Dimensione Formato  
1-s2.0-S0304414920303239-main.pdf

non disponibili

Descrizione: Articolo principale
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 2.02 MB
Formato Adobe PDF
2.02 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
arxiv-preprint-1808.05328.pdf

accesso aperto

Tipologia: 1. Preprint / submitted version [pre- review]
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 479.15 kB
Formato Adobe PDF
479.15 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2857194