Abstract
The performance of individual pseudo-random sequence, generated by some mechanism, is often not ideal. The asymptotic performance of the addition (in the sense (mod ρ)) of a large number of such individual sequences is studied and the necessary and sufficient condition under which the resulting sequence may converge to genuine randomness is obtained.
Similar content being viewed by others
References
Wichmann, B. A., Hill, I. D., An efficient and portable pseudo- random number generators,Appl. Statist., 1982, 31:188.
L’Ecuyer, P., Efficient and portable combined random number generators,Comm. of the ACM, 1988, 31:742.
L’Ecuyer, P., Tezuka, S., Structural properties for two classes of combined random number generators,Math. Comp., 1991, 57:735.
Marsaglia, G., A current view of random number of generators, inProceedings of the 16th Symposium on the Interface, North Holland: Elsevier Science Publishers, 1985.
Collins, B. J., Compound random number generators,JASA, 1987, 82:525.
Anderson, S. L., Random number generators on vector supercomputers and other advanced architectures,SIAM Review, 1990, 32:221.
Petrov, V. V.,Sums of Independent Random Variables, Berlin: Springer-Verlag. 1975.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China, the UPGC of Hong Kong, Hong Kong Baptist University and SRCU.
Rights and permissions
About this article
Cite this article
Chen, X., Fang, K., Zhang, R. et al. Asymptotics in addition of pseudo-random sequences. Sci. China Ser. A-Math. 40, 612–621 (1997). https://doi.org/10.1007/BF02876065
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02876065