scholarly journals Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic Analyses

2016 ◽  
Vol 62 (4) ◽  
pp. 1795-1822 ◽  
Author(s):  
Masahito Hayashi ◽  
Shun Watanabe
Author(s):  
E. Jack Chen

A facility for generating sequences of pseudorandom numbers is a fundamental part of computer simulation systems. Furthermore, multiple independent streams of random numbers are often required in simulation studies, for instance, to facilitate synchronization for variance-reduction purposes, and for making independent replications. A portable set of software utilities is described for uniform random-number generation. It provides for multiple generators (streams) running simultaneously, and each generator (stream) has its sequence of numbers partitioned into many long disjoint contiguous substreams. Simple procedure calls allow the user to make any generator “jump” ahead/back v steps (random numbers). Implementation issues are discussed. An efficient and portable code is also provided to implement the package. The basic underlying generator CMRG (combined Multiple Recursive Generator) combines two multiple recursive random number generators with a period length of approximately 2191 (˜ 3.1× 1057), good speed, and excellent theoretical properties.


Sign in / Sign up

Export Citation Format

Share Document