Direct Methods

  • Luca Martino
  • David Luengo
  • Joaquín Míguez
Part of the Statistics and Computing book series (SCO)


In this chapter we look into a collection of direct methods for random sampling. The term direct is used here to indicate that i.i.d. random draws with exactly the desired probability distribution are produced by applying a transformation that maps one (or many) realizations from the available random source into a realization from the target random variable. Most often, this transformation can be described as a deterministic map. However, we also include here techniques that rely on either discrete or continuous mixtures of densities and which can be interpreted as (pseudo)stochastic transformations of the random source.

Furthermore, many of the techniques proposed in the literature are found to be closely related when studied in sufficient detail. We pay here specific attention to some of these links, as they can be later exploited for the design of more efficient samplers, or simply to attain a better understanding of the field.


  1. 1.
    F.S. Acton, Numerical Methods That Work (The Mathematical Association of America, Washington, DC, 1990)zbMATHGoogle Scholar
  2. 2.
    J.H. Ahrens, U. Dieter, Computer methods for sampling from the exponential and normal distributions. Commun. ACM 15, 873–882 (1972)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    J.H. Ahrens, U. Dieter, Computer methods for sampling from gamma, beta, Poisson and binomial distributions. Computing 12, 223–246 (1974)zbMATHGoogle Scholar
  4. 4.
    G.E.P. Box, M.E. Muller, A note on the generation of random normal deviates. Ann. Math. Stat. 29, 610–611 (1958)CrossRefzbMATHGoogle Scholar
  5. 5.
    R.L. Burden, J.D. Faires, Numerical Analysis (Brooks Cole, Belmont, 2000)zbMATHGoogle Scholar
  6. 6.
    J. Dagpunar, Principles of Random Variate Generation (Clarendon Press, Oxford/New York, 1988)zbMATHGoogle Scholar
  7. 7.
    J. Dagpunar, Simulation and Monte Carlo: With Applications in Finance and MCMC (Wiley, Chichester, 2007)CrossRefzbMATHGoogle Scholar
  8. 8.
    M.H. DeGroot, M.J. Schervish, Probability and Statistics, 3rd edn. (Addison-Wesley, New York, 2002)Google Scholar
  9. 9.
    L. Devroye, Random variate generation for unimodal and monotone densities. Computing 32, 43–68 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    L. Devroye, Non-uniform Random Variate Generation (Springer, New York, 1986)CrossRefzbMATHGoogle Scholar
  11. 11.
    K.T. Fang, Z.H. Yang, S. Kotz, Generation of multivariate distributions by vertical density representation. Statistics 35(3), 281–293 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    J.E. Gentle, Random Number Generation and Monte Carlo Methods (Springer, New York, 2004)zbMATHGoogle Scholar
  13. 13.
    W.R. Gilks, Derivative-free adaptive rejection sampling for Gibbs sampling. Bayesian Stat. 4, 641–649 (1992)zbMATHGoogle Scholar
  14. 14.
    W.R. Gilks, P. Wild, Adaptive rejection sampling for Gibbs sampling. Appl. Stat. 41(2), 337–348 (1992)CrossRefzbMATHGoogle Scholar
  15. 15.
    W. Hörmann, J. Leydold, G. Derflinger, Automatic Nonuniform Random Variate Generation (Springer, New York, 2003)zbMATHGoogle Scholar
  16. 16.
    M.C. Jones, On Khintchine’s theorem and its place in random variate generation. Am. Stat. 56(4), 304–307 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    A.Y. Khintchine, On unimodal distributions. Izvestiya NauchnoIssledovatel’skogo Instituta Matematiki i Mekhaniki 2, 1–7 (1938)Google Scholar
  18. 18.
    A.J. Kinderman, J.G. Ramage, Computer generation of normal random variables. J. Am. Stat. Assoc. 71(356), 893–898 (1976)CrossRefzbMATHGoogle Scholar
  19. 19.
    S. Kotz, M.D. Troutt, On vertical density representation and ordering of distributions. Statistics 28, 241–247 (1996)sGoogle Scholar
  20. 20.
    T.J. Kozubowski, On the vertical density of the multivariate exponential power distribution. Statistics 36, 219–221 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    G. Marsaglia, The exact-approximation method for generating random variables in a computer. Am. Stat. Assoc. 79(385), 218–221 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    J.R. Michael, W.R. Schucany, R.W. Haas, Generating random variates using transformations with multiple roots. Am. Stat. 30(2), 88–90 (1976)zbMATHGoogle Scholar
  23. 23.
    J.G. Proakis, Digital Communications, 4th edn. (McGraw-Hill, Singapore, 2000)zbMATHGoogle Scholar
  24. 24.
    C.P. Robert, G. Casella, Monte Carlo Statistical Methods (Springer, New York, 2004)CrossRefzbMATHGoogle Scholar
  25. 25.
    E. Stadlober, H. Zechner, The patchwork rejection technique for sampling from unimodal distributions. ACM Trans. Model. Comput. Simul. 9(1), 59–80 (1999)CrossRefGoogle Scholar
  26. 26.
    M.D. Troutt, A theorem on the density ordinate and an alternative interpretation of the Box-Muller method. Statistics 22, 463–466 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    M.D. Troutt, Vertical density representation and a further remark on the Box-Muller method. Statistics 24, 81–83 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    M.D. Troutt, W.K. Pang, S.H. Hou, Vertical Density Representation and Its Applications (World Scientific, Singapore, 2004)CrossRefzbMATHGoogle Scholar
  29. 29.
    A.W. Van Kemp, Patchwork rejection algorithms. J. Comput. Appl. Math. 31(1), 127–131 (1990)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Luca Martino
    • 1
  • David Luengo
    • 2
  • Joaquín Míguez
    • 1
  1. 1.Department of Signal Theory and CommunicationsCarlos III University of MadridMadridSpain
  2. 2.Department of Signal Theory and CommunicationsTechnical University of MadridMadridSpain

Personalised recommendations