Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the fundamentals of random number generators, distinguishing between true random numbers from physical sources and pseudo random numbers generated by deterministic algorithms. It explains the criteria for evaluating pseudo random number sequences, such as uniformity and absence of correlations. The lecture delves into the modulo generator algorithm, detailing the congruential algorithm and its limitations. It also explores advanced techniques like the shuffle algorithm and the combination of different series to enhance randomness. The RAN2 algorithm, proposed by 'Numerical Recipes', is presented as a comprehensive approach combining various methods.