Home Generation of k-wise independent random variables with small randomness
Article
Licensed
Unlicensed Requires Authentication

Generation of k-wise independent random variables with small randomness

  • Taku Achiha , Hiroshi Sugita EMAIL logo , Kenta Tonohiro and Yuto Yamamoto
Published/Copyright: August 17, 2019

Abstract

A quick generation method of k-wise independent uniformly distributed m-bit random variables with small randomness is proposed with applications to the Monte Carlo method.

MSC 2010: 11K45; 65C10

Award Identifier / Grant number: JP18K03330

Funding statement: This work was partially supported by JSPS KAKENHI Grant Number JP18K03330.

Acknowledgements

T. Achiha, K. Tonohiro and Y. Yamamoto are former students of H. Sugita at Osaka University.

References

[1] M. Dietzfelbinger, Universal hashing and k-wise independent random variables via integer arithmetic without primes, Annual Symposium on Theoretical Aspects of Computer Science—STACS’96, Lecture Notes in Comput. Sci. 1046, Springer, Berlin (1996), 569–580. 10.1007/3-540-60922-9_46Search in Google Scholar

[2] N. Etemadi, An elementary proof of the strong law of large numbers, Z. Wahrsch. Verw. Gebiete 55 (1981), no. 1, 119–122. 10.1007/BF01013465Search in Google Scholar

[3] A. Joffe, On a set of almost deterministic k-independent random variables, Ann. Probab. 2 (1974), no. 1, 161–162. 10.1214/aop/1176996762Search in Google Scholar

[4] H. Sugita, Pseudo-random number generator by means of irrational rotation, Monte Carlo Methods Appl. 1 (1995), no. 1, 35–57. 10.1515/mcma.1995.1.1.35Search in Google Scholar

[5] H. Sugita, Robust numerical integration and pairwise independent random variables, J. Comput. Appl. Math. 139 (2002), no. 1, 1–8. 10.1016/S0377-0427(01)00394-6Search in Google Scholar

[6] H. Sugita, Dynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration, Math. Comput. Simulation 62 (2003), no. 3–6, 529–537. 10.1016/S0378-4754(02)00231-8Search in Google Scholar

[7] H. Sugita, Numerical integration for complicated functions and random sampling, Sugaku Expositions 19 (2006), no. 2, 153–169. Search in Google Scholar

[8] H. Sugita, Monte Carlo Method, Random Number, and Pseudorandom Number, MSJ Mem. 25, Mathematical Society of Japan, Tokyo, 2011. 10.2969/msjmemoirs/025010000Search in Google Scholar

[9] H. Sugita, Random Weyl sampling—A secure Monte Carlo integration method, Nonlinear Theory Appl. 7 (2016), no. 1, 2–13. 10.1587/nolta.7.2Search in Google Scholar

[10] H. Sugita, The Random Sampler, A C/C++ library for Pseudorandom generation and Dynamic random Weyl Sampling, included in [8], Chapter 6, and available at http://www.math.sci.osaka-u.ac.jp/~sugita/mcm_E.html. Search in Google Scholar

[11] H. Sugita, Probability and Random Number. A First Guide to Randomness, World Scientific, Hackensack, 2017. 10.1142/10662Search in Google Scholar

[12] H. Sugita and S. Takanobu, Random Weyl sampling for robust numerical integration of complicated functions, Monte Carlo Methods Appl. 6 (2000), no. 1, 27–48. 10.1515/mcma.2000.6.1.27Search in Google Scholar

[13] M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22 (1981), no. 3, 265–279; Special issue dedicated to Michael Machtey. 10.1016/0022-0000(81)90033-7Search in Google Scholar

Received: 2019-04-07
Revised: 2019-07-12
Accepted: 2019-07-26
Published Online: 2019-08-17
Published in Print: 2019-09-01

© 2019 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 17.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/mcma-2019-2046/html
Scroll to top button