A chemical reaction network specifies chemical species, reactions between them, and their stoichiometric vectors. It can be modelled deterministically by reaction-rate equations or stochastically by molecule-copy-number jumps.
Equal constant production, individual linear removal, and joint bimolecular removal give . For the unique stable equilibrium is symmetric and solves . For , every point on is an equilibrium: the difference is conserved and trajectories approach the equilibrium on their own constant-difference line.
// Target: mathematical-biology.bigb
If individual removal is absent, simultaneous removal of one molecule from each species leaves unchanged. Independent constant-rate births change it by plus or minus one, each at rate . The difference is therefore a symmetric continuous-time random walk on the integers with variance growing as displayed. It has no normalizable stationary law. This explains why a deterministic attracting line of equilibria does not provide a stationary stochastic distribution.
For and mean lifetime , the normalized restoring matrix is and the diffusion matrix is . Solving the normalized stationary fluctuation-dissipation relation for a reaction network gives the displayed covariance. The sum mode remains damped, but the difference mode's restoring rate is . Its noise grows without bound relative to that restoring rate as , giving strong negative correlations and invalidating small-fluctuation closure near exclusive joint removal.
// Target: mathematical-biology.bigb
A chemical species is a class of chemically identical entities treated as one component of a reaction system.
The mole fraction of species is , where is its amount in moles. It is dimensionless and equals the volume mixing ratio for an ideal gas mixture.
For an ideal gas mixture, the volume mixing ratio equals the mole fraction, number fraction, and ratio of partial to total pressure: , with . This equivalence fails for general nonideal mixtures.
The stoichiometric vector of reaction records its net change in each chemical species. If the copy-number state is , firing the reaction changes it to .
The displayed logarithmic derivative compares the loss and production flux sensitivities of species to the mean amount . At a steady state , it converts the normalized negative drift Jacobian into , where is the mean molecular lifetime. For constant production and loss proportional to , the scalar elasticity is .
// Target: mathematical-biology.bigb
This noise-relevant event size weights absolute stoichiometric jump sizes by their molecular turnover flux. At stationarity the denominator is twice the balanced production or removal flux , so the normalized diffusion diagonal is . Fixed birth bursts of size and unit deaths give . This quantity is not the event-count-weighted average absolute jump size.
// Target: mathematical-biology.bigb
At stationarity, the mean number divided by the molecular removal flux is the mean time a molecule remains in the system. Birth or death event rates must be multiplied by the numbers of molecules changed in each event before computing this lifetime.
// Target: mathematical-biology.bigb
Compartment-based stochastic diffusion represents molecular motion by nearest-neighbour jumps on a spatial lattice. Jump rates of order converge to an advection--diffusion equation as compartment width tends to zero.
The asymmetric simple exclusion process permits at most one particle per lattice site and biases jumps in one direction. A mean-field hydrodynamic limit has advective flux proportional to because both an occupied departure site and vacant arrival site are required.
An immigration--death process has constant birth rate and linear death rate in state . Its stationary distribution is Poisson with mean .
A population jumps from to at a constant immigration rate and from to at rate . Applying its Markov jump-process generator to and gives the displayed mean and variance equations. For and finite initial second moment, the stationary mean and variance are and . Interpreting the pair-arrival rate as proportional to population instead would produce a different branching process.
A stochastic quasi-steady-state approximation replaces fast species by their stationary conditional distribution given the slow species. Averaging slow propensities over that distribution yields a reduced Markov jump process.
A slow-scale stochastic simulation algorithm applies the Gillespie algorithm to propensities averaged over fast conditional equilibrium, avoiding explicit simulation of every fast reaction.
The molecular copy number of a chemical species is the nonnegative integer number of its molecules in a specified reactor or compartment.
The reaction propensity is the instantaneous rate at which reaction fires when the copy-number state is . Conditional on the present state, its reaction clock has an exponential distribution of rate .
A power-law propensity uses the same reactant monomial as a deterministic law of mass action, scaled by reactor volume. For example, a bimolecular channel may be assigned . This convention differs at small copy number from the combinatorial propensity and must therefore be stated explicitly.
For reactions with stoichiometric vectors and reaction propensity functions , the probability mass function obeys
It is the forward operator of a Markov jump process equation for the copy-number continuous-time Markov chain.
The Gillespie algorithm samples an exact path of a well-mixed stochastic reaction network. At state , let ; draw a waiting time with exponential distribution of rate , choose reaction with probability , and update .
A moment hierarchy is the coupled family of equations obtained by applying a Markov jump-process generator to powers of the state. Nonlinear reaction propensity functions make a moment of one order depend on higher-order moments, so the hierarchy generally does not close after finitely many equations.
For a Markov jump-process generator , differentiating an integrable observable gives , when the generator identity and interchange are justified. Choosing powers gives equations for moments. These need not form a closed finite system.
A moment closure replaces higher moments in a moment hierarchy by functions of retained lower moments. It converts an infinite hierarchy into a finite approximate system.
A central-moment closure sets selected high-order central moments to zero. For example, setting the third central moment of to zero gives

Articles by others on the same topic (0)

There are currently no matching articles.