Monte Carlo Simulation

  • Mark Chang
Part of the Statistics for Biology and Health book series (SBH)


Monte Carlo simulation is the technique to mimic a dynamic system or process using a computer program. Computer simulations, as an efficient and effective research tool, have been used virtually everywhere, including in biostatistics, engineering, finance, and other areas. To perform simulations, we often need to draw random samples from a certain probability distribution. Typically, the simplest and most important random sampling procedure is sampling from the uniform distribution over (0, 1), denoted by \(U\left (0,1\right )\). The computer-generated “random” number is not truly random because the sequence of numbers is determined by the so-called seed, an initial number. Random variates from other distributions can often be obtained by applying a transformation to uniform variates. There are usually several algorithms available to generate random numbers from a particular distribution. The algorithms differ in speed, accuracy, and the computer memory required. Many software packages have implemented various algorithms to generate random numbers with different probability distributions. Here we introduce a few commonly used algorithms.


PBPK Model Adaptive Design Conditional Power Druglike Molecule Urea Cycle Disorder 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Further Readings and References

  1. Baldi, P., Hirschberg, D.S.: An intersection inequality sharper than the Tanimoto triangle inequality for efficiently searching large databases. J. Chem. Inf. Model. 49(8), 1866–1870 (2009)CrossRefGoogle Scholar
  2. Chang, M.: Clinical trial simulations in early development phases. In: Chow, S.C. (ed.) Encyclopedia of Biopharmaceutical Statistics. Taylor and Francis, New York (2007)Google Scholar
  3. Chang, M.: Monte Carlo Simulation for the Pharmaceutical Industry. Chapman and Hall/CRC, Boca Raton (2010)CrossRefGoogle Scholar
  4. Chen, M., Hofestädt, R.: Quantitative Petri net model of gene regulated metabolic networks in the cell. In Silico Biol. 3(3), 347–365 (2003)Google Scholar
  5. Chernick, M.: Bootstrap Methods: A Guide for Practitioners and Researchers, 2nd edn. Wiley-Interscience, New York (2007)Google Scholar
  6. Clark, A.: Applied Pharmacology, 5th edn. Churchill, London (1933)Google Scholar
  7. Efron, B., Tibshirani, R.: An Introduction to the Bootstrap. Chapman and Hall/CRC, Boca Raton (1994)Google Scholar
  8. Fishman, G.: Monte Carlo, Concepts, Algorithms and Applications. Springer, New York (1996)zbMATHGoogle Scholar
  9. Hamilton, S., Ho, K.F.: Efficient drug supply algorithms for stratified clinical trials by focusing on patient coverage-not just site supplies-this dynamic approach significantly reduces drug waste. Appl. Clin. Trials Feb 1 (2004)Google Scholar
  10. Höltje, H., Sippl, W., et al.: Molecular Modeling: Basic Principles and Applications, 3rd edn. Wiley-VCH, Frankfurt (2008)Google Scholar
  11. Hougaard, P.: Analysis of Multivariate Survival Data. Springer-Verlag, New York (2001)Google Scholar
  12. Koch, I., Heiner, M.: Petri net. In: Junker, B.H. (eds.) Analysis of Biological Netwarks. Wiley, Hoboken (2008)Google Scholar
  13. Lipinski, C.A., Lombardo, F., Dominy, B.W., Feeney, P.J.: Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings. Adv. Drug Deliv. Rev. 23, 3–25 (1997)CrossRefGoogle Scholar
  14. Lipkus, A.: A proof of the triangle inequality for the Tanimoto distance. J. Math. Chem. 26, 263–265 (1999)zbMATHCrossRefGoogle Scholar
  15. Liu, J.S.: Monte Carlo Strategies in Scientific Computing. Springer, New York (2001)zbMATHGoogle Scholar
  16. Materi, W., Wishart, D.S.: Computational systems biology in drug discovery and development: Methods and applications. Drug Discov. Today 12(7/8), 295–303 (2007)CrossRefGoogle Scholar
  17. Matsuno, H., et al.: Biopathways representation and simulation on hybrid functional Petri net. In Silico Biol. 3, 389–404 (2003)Google Scholar
  18. Miyamoto, S., Kollman, P.A.: Absolute and relative binding free energy calculations of the interaction of biotin and its analogs with streptavidin using molecular dynamics/free energy perturbation approaches. Proteins 16, 226–245 (1993)CrossRefGoogle Scholar
  19. Paolini, G.V., Shapland, R.H.B., van Hoorn, W.P., Mason, J.S., Hopkins, A.L.: Global mapping of pharmacological space. Nat. Biotechnol. 24, 805–815 (2006)CrossRefGoogle Scholar
  20. Schneider, G., Baringhaus, K.H.: Molecular Design: Concepts and Applications. Wiley-VCH Verlag, Frankfurt (2008)Google Scholar
  21. Szarfman, A., Machado, S.G., O’Neill, R.T.: Use of screening algorithms and computer systems to efficiently signal higher-than-expected combinations of drugs and events in the US FDA’s spontaneous reports database. Drug Saf. 25(6), 381–392 (2002)CrossRefGoogle Scholar
  22. Taylor, H.M., Karlin, S.: An Introduction to Stochastic Modeling, 3rd edn. Academic, San Diego (1998)zbMATHGoogle Scholar
  23. Von Neuman, J.: Various technigues used in connection with random digits. National Bureau of Standards Applied Math Series 3, 36–38 (1951)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Mark Chang
    • 1
  1. 1.BiometricsAMAG Pharmaceuticals, Inc.LexingtonUSA

Personalised recommendations