Chemical master versus chemical langevin for first-order reaction networks

Desmond J. Higham, Raya Khanin

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Markov jump processes are widely used to model interacting species in circumstances where discreteness and stochasticity are relevant. Such models have been particularly successful in computational cell biology, and in this case, the interactions are typically rst-order. The Chemical Langevin Equation is a stochastic dierential equation that can be regarded as an approximation to the underlying jump process. In particular, the Chemical Langevin Equation allows simulations to be performed more eectively. In this work, we obtain expressions for the rst and second moments of the Chemical Langevin Equation for a generic rst-order reaction network. Moreover, we show that these moments exactly match those of the under-lying jump process. Hence, in terms of means, variances and correlations, the Chemical Langevin Equation is an excellent proxy for the Chemical Master Equation. Our work assumes that a unique solution exists for the Chemical Langevin Equation. We also show that the moment matching re- sult extends to the case where a gene regulation model of Raser and O'Shea (Science, 2004) is replaced by a hybrid model that mixes elements of the Master and Langevin equations. We nish with numerical experiments on a dimerization model that involves second order reactions, showing that the two regimes continue to give similar results.
Original languageEnglish
Pages (from-to)59-79
Number of pages21
JournalOpen Applied Mathematics Journal
Publication statusPublished - 2008

Keywords / Materials (for Non-textual outputs)

  • birth-and-death process
  • chemical master equation
  • chemical kinetics
  • correlation matrix
  • gene regulation network
  • stochastic simulation algorithm


Dive into the research topics of 'Chemical master versus chemical langevin for first-order reaction networks'. Together they form a unique fingerprint.

Cite this