Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: 64-bit KISS RNGs
Replies: 25   Last Post: Mar 17, 2009 4:15 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Phillip Helbig---remove CLOTHES to reply

Posts: 33
Registered: 12/13/04
Re: 64-bit KISS RNGs
Posted: Mar 1, 2009 4:49 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <godlg7$a4j$1@soup.linux.pwf.cam.ac.uk>, nmm1@cam.ac.uk
writes:

> Galathaea's concern was about the period, and she is very right to
> be so concerned. While a long period does not guarantee pseudo-
> randomness, it is a prerequisite for it - in particular, the pseudo-
> random properties in N dimensions are often limited by the Nth root
> of the period. And, despite common belief, that is NOT solely true
> for multiplicative congruential generators.


The period of RANLUX is huge---10**164 or something. (In other words,
many orders of magnitude larger than the number of distinct bit
combinations. Many lesser generators have a period much LESS than the
number of distinct bit combinations and some algorithms can have a
period at most as long as the number of distinct bit combinations. In
these cases, of course, a given number x is always followed by a given
number y, which with RANLUX is not the case.)




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.