Skip to main content

Stochastic Modeling

  • Chapter
  • First Online:
Introduction to Synthetic Biology

Part of the book series: Learning Materials in Biosciences ((LMB))

Abstract

A deterministic modeling approach – as the one explained in Chap. 2 assumes to deal with systems isolated from any source of noise, or randomness, that could spoil model predictions. In classical physics this approximation is generally valid. Biological systems, however, are intrinsically noisy, which makes deterministic models inappropriate to simulate, at least, certain kinds of synthetic gene circuits. The stochastic simulation (or Gillespie) algorithm is a purely computational approach to calculate the temporal evolution of biological systems. In principle, it may give a more realistic description of gene circuit dynamics. However, it becomes computationally too demanding if applied to large synthetic networks. In this Chapter, we will explain the theoretical foundations, working, and recent improvements of this algorithm. Moreover, we will discuss under which conditions a deterministic model can provide faithful predictions, despite the complexity of the system, and when, in contrast, stochastic simulations are preferable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In general, \(\langle s_T \rangle ^2 \neq \langle s_T^2 \rangle \).

  2. 2.

    The standard deviation of x – over a set of N data – is calculated as: \(\sigma (x) = \sqrt {\frac {1}{N}\sum _{i=1}^N (x_i - \langle x \rangle )^2}\). It represents the average error associated with each measurement.

  3. 3.

    If we call CF i and YF i the cyan and yellow fluorescence measured from the ith cell over a population of N samples, the average intrinsic noise corresponds to

    $$\displaystyle \begin{aligned} \eta_{int} =\frac{1}{N}\sum_{i=1}^N | CF_i - YF_i | \,\mbox{.} {} \end{aligned} $$
  4. 4.

    The concentration of LacI in the Repressilator oscillates over time – see Chap. 6. The Repressilator was inserted into lacI cells.

  5. 5.

    In a deterministic framework, the initial conditions (x 0, t 0) determine unequivocally the ODE solutions. In a stochastic framework, (x 0, t 0) determine unequivocally the probability that the system lies in x at time t.

  6. 6.

    In the phase space every point corresponds to a different system configuration (parameter values and species concentrations). A trajectory in the phase space gives the temporal evolution of a system from its initial state to the equilibrium.

  7. 7.

    The Poisson distribution \(\mathcal {P}(n,\lambda )\) gives the probability that a discrete random variable K is equal to n, where n = 0, 1, 2, … It is defined as

    $$\displaystyle \begin{aligned} Prob(K=n)=\mathcal{P}(n, \lambda)= \frac{\lambda^n e^{-\lambda}}{n!} \mbox{,} \end{aligned} $$
    (4.22)

    where λ is greater than zero and represents both the expected value (the mean) and the variance of the distribution. In other words, Prob(K = n) is maximal when n = λ. In the tau-leaping method, K = k j and λ = a j(x)τ. Each k j can be computed with the inversion method after drawing a random number r 2 from the uniform distribution between zero and one and setting r 2 = Prob(k j = n).

  8. 8.

    In some variants of the tau-leaping algorithm τ is fixed.

  9. 9.

    A Normal distribution with mean value μ and variance σ 2 is defined as \(\mathcal {N}(\mu ,\sigma ^2)=\frac {1}{\sqrt {2\pi }\sigma }e^{-\frac {(x-\mu )^2}{2\sigma ^2}}\), where x is a continuous (real) variable. Notice that \(\mathcal {N}(\mu ,\sigma ^2)=\mu + \sigma \mathcal {N}(0,1)\).

  10. 10.

    τ is renamed as dt and the limit dt → 0 is then considered.

  11. 11.

    It holds that \(\langle \xi _i(t) \xi _j(t^{'}) \rangle =\delta _{ij}\delta (t-t^{'})\).

References

  1. M.B. Elowitz, S. Leibler, A synthetic oscillatory network of transcriptional regulators. Nature 403(6767), 335–338 (2000)

    Article  CAS  PubMed  Google Scholar 

  2. M.B. Elowitz, A.J. Levine, E.D. Siggia, P.S. Swain, Stochastic gene expression in a single cell. Science 297(5584), 1183–1186 (2002)

    Article  CAS  PubMed  Google Scholar 

  3. D.T. Gillespie, A general method for numerically simulating the stochastic time evolution of coupled chemical species. J. Comput. Phys. 22, 403–434 (1976)

    Article  CAS  Google Scholar 

  4. D.T. Gillespie, L.R. Petzold, Numerical simulation for biochemical kinetics, in System Modeling in Cellular Biology, ed. by Z. Szallasi, J. Stelling, V. Periwal (MIT Press, Cambridge, 2006), pp. 331–353

    Chapter  Google Scholar 

  5. M.S. Samoilov, A.P. Arkin, Deviant effects in molecular reaction pathways. Nat. Biotechnol. 24(10), 1235–1240 (2006)

    Article  CAS  PubMed  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Marchisio, M.A. (2018). Stochastic Modeling. In: Introduction to Synthetic Biology. Learning Materials in Biosciences. Springer, Singapore. https://doi.org/10.1007/978-981-10-8752-3_4

Download citation

Publish with us

Policies and ethics