اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTime-dependent product-form Poisson distributions for reaction networks with higher order complexes
111
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It is well known that stochastically modeled reaction networks that are complex balanced admit a stationary distribution that is a product of Poisson distributions. In this paper, we consider the following related question: supposing that the initial distribution of a stochastically modeled reaction network is a product of Poissons, under what conditions will the distribution remain a product of Poissons for all time? By drawing inspiration from Crispin Gardiners Poisson representation for the solution to the chemical master equation, we provide a necessary and sufficient condition for such a product-form distribution to hold for all time. Interestingly, the condition is a dynamical complex-balancing for only those complexes that have multiplicity greater than or equal to two (i.e. the higher order complexes that yield non-linear terms to the dynamics). We term this new condition the dynamical and restricted complex balance condition (DR for short).
قيم البحث
اقرأ أيضاً
We consider stochastically modeled chemical reaction systems with mass-action kinetics and prove that a product-form stationary distribution exists for each closed, irreducible subset of the state space if an analogous deterministically modeled syste
m with mass-action kinetics admits a complex balanced equilibrium. Feinbergs deficiency zero theorem then implies that such a distribution exists so long as the corresponding chemical network is weakly reversible and has a deficiency of zero. The main parameter of the stationary distribution for the stochastically modeled system is a complex balanced equilibrium value for the corresponding deterministically modeled system. We also generalize our main result to some non-mass-action kinetics.
We derive a reduction formula for singularly perturbed ordinary differential equations (in the sense of Tikhonov and Fenichel) with a known parameterization of the critical manifold. No a priori assumptions concerning separation of slow and fast vari
ables are made, or necessary.We apply the theoretical results to chemical reaction networks with mass action kinetics admitting slow and fast reactions. For some relevant classes of such systems there exist canonical parameterizations of the variety of stationary points, hence the theory is applicable in a natural manner. In particular we obtain a closed form expression for the reduced system when the fast subsystem admits complex balanced steady states.
Chemical reaction networks describe interactions between biochemical species. Once an underlying reaction network is given for a biochemical system, the system dynamics can be modelled with various mathematical frameworks such as continuous time Mark
ov processes. In this manuscript, the identifiability of the underlying network structure with a given stochastic system dynamics is studied. It is shown that some data types related to the associated stochastic dynamics can uniquely identify the underlying network structure as well as the system parameters. The accuracy of the presented network inference is investigated when given dynamical data is obtained via stochastic simulations.
Deficiency zero is an important network structure and has been the focus of many celebrated results within reaction network theory. In our previous paper textit{Prevalence of deficiency zero reaction networks in an ErdH os-Renyi framework}, we provid
ed a framework to quantify the prevalence of deficiency zero among randomly generated reaction networks. Specifically, given a randomly generated binary reaction network with $n$ species, with an edge between two arbitrary vertices occurring independently with probability $p_n$, we established the threshold function $r(n)=frac{1}{n^3}$ such that the probability of the random network being deficiency zero converges to 1 if $frac{p_n}{r(n)}to 0$ and converges to 0 if $frac{p_n}{r(n)}toinfty$, as $n to infty$. With the base ErdH os-Renyi framework as a starting point, the current paper provides a significantly more flexible framework by weighting the edge probabilities via control parameters $alpha_{i,j}$, with $i,jin {0,1,2}$ enumerating the types of possible vertices (zeroth, first, or second order). The control parameters can be chosen to generate random reaction networks with a specific underlying structure, such as closed networks with very few inflow and outflow reactions, or open networks with abundant inflow and outflow. Under this new framework, for each choice of control parameters ${alpha_{i,j}}$, we establish a threshold function $r(n,{alpha_{i,j}})$ such that the probability of the random network being deficiency zero converges to 1 if $frac{p_n}{r(n,{alpha_{i,j}})}to 0$ and converges to 0 if $frac{p_n}{r(n,{alpha_{i,j}})}to infty$.
Reaction networks are commonly used within the mathematical biology and mathematical chemistry communities to model the dynamics of interacting species. These models differ from the typical graphs found in random graph theory since their vertices are
constructed from elementary building blocks, i.e., the species. In this paper, we consider these networks in an ErdH os-Renyi framework and, under suitable assumptions, derive a threshold function for the network to have a deficiency of zero, which is a property of great interest in the reaction network community. Specifically, if the number of species is denoted by $n$ and if the edge probability is denote by $p_n$, then we prove that the probability of a random binary network being deficiency zero converges to 1 if $frac{p_n}{r(n)}to 0$, as $n to infty$, and converges to 0 if $frac{p_n}{r(n)}to infty$, as $n to infty$, where $r(n)=frac{1}{n^3}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
