**I**n case you did not read all the slides of Regis Lebrun’s talk on pseudo-random generators I posted yesterday, one result from Marsaglia’s (in a 1968 PNAS paper) exhibited my ignorance during Regis’ Big’ MC seminar on Thursday. Marsaglia indeed showed that *all* multiplicative congruential generators

lie on a series of hyperplanes whose number gets ridiculously small as the dimension *d* increases! If you turn the ’s into uniforms and look at the d dimensional vectors

they are on a small number of hyperplanes, at most , which gives 41 hyperplanes when … So in this sense all generators share the same poor property as the infamous RANDU which is such that that is always over one of 16 hyperplanes, an exercise we use in both *Introducing Monte Carlo Methods with R* and **Monte Carlo Statistical Methods** (but not in our general audience out solution manual). I almost objected to the general result being irrelevant as the ’s share ’s, but of course the subsequence also share enjoys this property!

Filed under: R, Statistics, University life Tagged: congruential generators, Introducing Monte Carlo Methods with R, Monte Carlo methods, Monte Carlo Statistical Methods, random simulation, RANDU

*Related*

To

**leave a comment** for the author, please follow the link and comment on his blog:

** Xi'an's Og » R**.

R-bloggers.com offers

**daily e-mail updates** about

R news and

tutorials on topics such as: visualization (

ggplot2,

Boxplots,

maps,

animation), programming (

RStudio,

Sweave,

LaTeX,

SQL,

Eclipse,

git,

hadoop,

Web Scraping) statistics (

regression,

PCA,

time series,

trading) and more...

If you got this far, why not

__subscribe for updates__ from the site? Choose your flavor:

e-mail,

twitter,

RSS, or

facebook...

**Tags:** congruential generators, Introducing Monte Carlo Methods with R, Monte Carlo methods, Monte Carlo Statistical Methods, R, random simulation, RANDU, statistics, University life