Lecture

Random Number Generators: Basics and Algorithms

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.