Abstract
This paper deals with the general nonlinear congruential method for generating uniform pseudorandom numbers, in which permutation polynomials over finite prime fields play an important role. It is known that these pseudorandom numbers exhibit an attractive equidistribution and statistical independence behavior. In the context of parallelized simulation methods, a large number of parallel streams of pseudorandom numbers with strong mutual statistical independence properties are required. In the present paper, such properties of parallelized nonlinear congruential generators are studied based on the discrepancy of certain point sets. Upper and lower bounds for the discrepancy both over the full period and over (sufficiently large) parts of the period are established. The method of proof rests on the classical Weil bound for exponential sums.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
