A recursive method to calculate the expected molecule numbers for a polymerization network with a small number of subunits

DOI10.1016/J.JMAA.2011.06.064zbMath1222.92038OpenAlexW2084388632MaRDI QIDQ719592

Zhigang Zhang

Publication date: 10 October 2011

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.06.064

zbMATH Keywords

stationary distributionstochastic simulationchemical reaction networkmultivariate Poisson distribution

Mathematics Subject Classification ID

Classical flows, reactions, etc. in chemistry (92E20) Dynamical systems in biology (37N25) Kinetics in biochemical problems (pharmacokinetics, enzyme kinetics, etc.) (92C45) Special processes (60K99)

Uses Software

• MVPoisson
• DEtools

Cites Work

• Product-form stationary distributions for deficiency zero chemical reaction networks
• The method of differentiating under the integral sign
• Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
• A symbolic computation approach to a problem involving multivariate Poisson distributions
• A stochastic analysis of actin polymerization in the presence of twinfilin and gelsolin
• A theoretical approach to actin filament dynamics
• Analysis of Explicit Tau-Leaping Schemes for Simulating Chemically Reacting Systems

This page was built for publication: A recursive method to calculate the expected molecule numbers for a polymerization network with a small number of subunits