Abstract
The ziggurat method is a fast random variable generation method introduced by Marsaglia and Tsang in a series of papers. We discuss how the ziggurat method can be implemented for low-discrepancy sequences, and present algorithms and numerical results when the method is used to generate samples from the normal and gamma distributions.
References
[1] C. Aistleitner and J. Dick, Low-discrepancy point sets for non-uniform measures, Acta Arith. 163 (2014), no. 4, 345–369. 10.4064/aa163-4-4Search in Google Scholar
[2] L. Devroye, Non-Uniform Random Variate Generation, Springer, New York, 1986. 10.1007/978-1-4613-8643-8Search in Google Scholar
[3] J. A. Doornik, An improved ziggurat method to generate normal random samples, Technical Report, University of Oxford, 2005, http://www.doornik.com/research/ziggurat.pdf. Search in Google Scholar
[4] G. Fishman, Monte Carlo, Springer, New York, 1996. 10.1007/978-1-4757-2553-7Search in Google Scholar
[5] A. Göncü and G. Ökten, Uniform point sets and the collision test, J. Comput. Appl. Math. 259 (2014), 798–804. 10.1016/j.cam.2013.07.019Search in Google Scholar
[6] J. Hartinger and J. R. Kainhofer, Non-uniform low-discrepancy sequence generation and integration of singular integrands, Monte Carlo and Quasi-Monte Carlo Methods 2004, Springer, Berlin (2006), 163–179. 10.1007/3-540-31186-6_11Search in Google Scholar
[7] E. Hlawka and R. Mück, A transformation of equidistributed sequences, Applications of Number Theory to Numerical Analysis, Academic Press, Cambridge (1972), 371–388. 10.1016/B978-0-12-775950-0.50018-2Search in Google Scholar
[8] P. H. Leong, G. Zhang, D. U. Lee, W. Luk and J. Villasenor, A Comment on the implementation of the Ziggurat method, J. Stat. Softw. 12 (2005), no. 7, 1–4. 10.18637/jss.v012.i07Search in Google Scholar
[9] G. Marsaglia and W. W. Tsang, A fast, easily implemented method for sampling from decreasing or symmetric unimodal density functions, SIAM J. Sci. Stat. Comput. 5 (1984), no. 2, 349–359. 10.1137/0905026Search in Google Scholar
[10] G. Marsaglia and W. W. Tsang, A simple method for generating gamma variables, ACM Trans. Math. Software 26 (2000), 363–372. 10.1145/358407.358414Search in Google Scholar
[11] G. Marsaglia and W. W. Tsang, The ziggurat method for generating random variables, J. Stat. Softw. 5 (2000), no. 8, 1–7. 10.18637/jss.v005.i08Search in Google Scholar
[12] M. Matsumoto and T. Nishimura, Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator, ACM Trans. Model. Comput. Simul. 8 (1998), no. 1, 3–30. 10.1145/272991.272995Search in Google Scholar
[13] H. Niederreiter, Error bounds for quasi-Monte Carlo integration with uniform point sets, J. Comput. Appl. Math. 150 (2003), 283–292. 10.1016/S0377-0427(02)00665-9Search in Google Scholar
[14] N. Nguyen and G. Ökten, The acceptance-rejection method for low-discrepancy sequences, Monte Carlo Methods Appl. 22 (2016), no. 2, 133–148. 10.1515/mcma-2016-0104Search in Google Scholar
[15] G. Ökten and W. Eastman, Randomized quasi-Monte Carlo methods in pricing securities, J. Econom. Dynam. Control 28 (2004), 2399–2426. 10.1016/j.jedc.2003.11.003Search in Google Scholar
[16] G. Ökten and A. Göncü, Generating low-discrepancy sequences from the normal distribution: Box–Muller or inverse transform?, Math. Comput. Model. 53 (2011), no. 5, 1268–1281. 10.1016/j.mcm.2010.12.011Search in Google Scholar
[17] I. M. Sobol’, Uniformly distributed sequences with an additional uniform property, USSR Comput. Math. Math. Phys. 16 (1976), no. 5, 236–242. 10.1016/0041-5553(76)90154-3Search in Google Scholar
[18] I. M. Sobol’, A primer for the Monte Carlo Method, CRC Press, Boca Raton, 1994. Search in Google Scholar
[19] H. Zhu and J. Dick, Discrepancy bounds for deterministic acceptance-rejection samplers, Electron. J. Stat. 8 (2014), 678–707. 10.1214/14-EJS898Search in Google Scholar
© 2018 Walter de Gruyter GmbH, Berlin/Boston
