Statistical Methods for Data Analysis Random number generators

Slides:



Advertisements
Similar presentations
Statistical Methods for Data Analysis Random number generators Luca Lista INFN Napoli.
Advertisements

RSLAB-NTU Lab for Remote Sensing Hydrology and Spatial Modeling 1 An Introduction to R Pseudo Random Number Generation (PRNG) Prof. Ke-Sheng Cheng Dept.
Generating Random Numbers
Monte Carlo Methods and Statistical Physics
Random number generation Algorithms and Transforms to Univariate Distributions.
Sampling Distributions
CF-3 Bank Hapoalim Jun-2001 Zvi Wiener Computational Finance.
Discrete Event Simulation How to generate RV according to a specified distribution? geometric Poisson etc. Example of a DEVS: repair problem.
K. Desch – Statistical methods of data analysis SS10
CSCE Monte Carlo Methods When you can’t do the math, simulate the process with random numbers Numerical integration to get areas/volumes Particle.
A) Transformation method (for continuous distributions) U(0,1) : uniform distribution f(x) : arbitrary distribution f(x) dx = U(0,1)(u) du When inverse.
Properties of Random Numbers
The Monte Carlo Method: an Introduction Detlev Reiter Research Centre Jülich (FZJ) D Jülich
Lecture II-2: Probability Review
Random Number Generation Fall 2013
1 CE 530 Molecular Simulation Lecture 7 David A. Kofke Department of Chemical Engineering SUNY Buffalo
Simulation of Random Walk How do we investigate this numerically? Choose the step length to be a=1 Use a computer to generate random numbers r i uniformly.
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Random Number Generators CISC/QCSE 810. What is random? Flip 10 coins: how many do you expect will be heads? Measure 100 people: how are their heights.
01/24/05© 2005 University of Wisconsin Last Time Raytracing and PBRT Structure Radiometric quantities.
Random Sampling, Point Estimation and Maximum Likelihood.
1 Lesson 3: Choosing from distributions Theory: LLN and Central Limit Theorem Theory: LLN and Central Limit Theorem Choosing from distributions Choosing.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
1 Lesson 8: Basic Monte Carlo integration We begin the 2 nd phase of our course: Study of general mathematics of MC We begin the 2 nd phase of our course:
Monte Carlo Methods.
Experimental Method and Data Process: “Monte Carlo Method” Presentation # 1 Nafisa Tasneem CHEP,KNU
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
Monte Carlo Methods So far we have discussed Monte Carlo methods based on a uniform distribution of random numbers on the interval [0,1] p(x) = 1 0  x.
Monté Carlo Simulation  Understand the concept of Monté Carlo Simulation  Learn how to use Monté Carlo Simulation to make good decisions  Learn how.
Review of Probability. Important Topics 1 Random Variables and Probability Distributions 2 Expected Values, Mean, and Variance 3 Two Random Variables.
Gil McVean, Department of Statistics Thursday February 12 th 2009 Monte Carlo simulation.
G. Cowan Lectures on Statistical Data Analysis Lecture 5 page 1 Statistical Data Analysis: Lecture 5 1Probability, Bayes’ theorem 2Random variables and.
MONTE CARLO METHOD DISCRETE SIMULATION RANDOM NUMBER GENERATION Chapter 3 : Random Number Generation.
Computer Simulation Henry C. Co Technology and Operations Management,
Lesson 8: Basic Monte Carlo integration
MECH 373 Instrumentation and Measurements
Random Numbers and Simulation
Oliver Schulte Machine Learning 726
STATISTICAL ORBIT DETERMINATION Kalman (sequential) filter
Approximate computations
Introduction to Monte Carlo Method
Basic simulation methodology
Intro to Sampling Methods
Parallel Programming in C with MPI and OpenMP
Random Number Generators
Approximate computations
3.1 Expectation Expectation Example
Monte-Carlo Techniques
Introduction to Instrumentation Engineering
Chapter 7 Sampling Distributions
Chapter 7 Sampling Distributions.
Monte Carol Integration
Lecture 2 – Monte Carlo method in finance
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
Computing and Statistical Data Analysis Stat 3: The Monte Carlo Method
STOCHASTIC HYDROLOGY Random Processes
Chapter 7 Sampling Distributions.
Monte Carlo I Previous lecture Analytical illumination formula
Computing and Statistical Data Analysis / Stat 7
Lecture 4 - Monte Carlo improvements via variance reduction techniques: antithetic sampling Antithetic variates: for any one path obtained by a gaussian.
LECTURE 09: BAYESIAN LEARNING
Statistical Data Mining
Computer Simulation Techniques Generating Pseudo-Random Numbers
Chapter 7 Sampling Distributions.
Statistical Methods for Data Analysis Random numbers with ROOT and RooFit Luca Lista INFN Napoli.
Random Variate Generation
More Monte Carlo Methods
9. Two Functions of Two Random Variables
Chapter 7 Sampling Distributions.
Generating Random Variates
Presentation transcript:

Statistical Methods for Data Analysis Random number generators Luca Lista INFN Napoli

Pseudo-random generators Requirement: Simulate random process with a computer E.g.: radiation interaction with matter, cosmic rays, particle interaction generators, … But also: finance, videogames, 3D graphics, ... Problem: Generate random (or almost random…) variables with a computer … but computers are deterministic! Luca Lista Statistical Methods for Data Analysis

Pseudo-random numbers Definition: Deterministic numeric sequences whose behavior is not easily predictable with simple analytic expressions (Re-) producible with an algorithm based on mathematical formulae Statistical behavior similar to real random sequences Luca Lista Statistical Methods for Data Analysis

Example from chaos transition Let’s fix an initial value x0 Define by recursion the sequence: xn+1 =  xn (1 – xn) Depending on , the sequence will have different possible behaviors If the sequence converges, we would have, for n the limit x solving the equation: x =  x (1 – x)  x = (1- )/ , 0 Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Stable behavior Actually, for sufficiently small  starting from: x0 = 0.5 the sequence converges xn n > 200  Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Bifurcation For  > 3 the series does not converge, but oscillates between two values: xa =  xb (1 – xb) xb =  xa (1 – xa) xn n > 200  Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Bifurcation II, III, … Bifurcation repeats when  grows Sequences of 4, 8, 16, … repeating values xn n > 200  Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Chaotic behavior xn For even larger  the sequence is unpredictable. For instance, for =4 values densely fills the interval [0, 1] 200 < n < 100000  Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Transition to chaos Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Another complete view Luca Lista Statistical Methods for Data Analysis

Properties of Random Numbers A ‘good’ random sequence: {x1, x2, …, xn, …} should be made of elements that are independent and identically distributed (i.i.d.) : P(xi) = P(xj),  i, j P(xn | xn-1) = P(xn),  n Luca Lista Statistical Methods for Data Analysis

(Pseudo-)random generators The standard C function drand48 is based on sequences of 48 bit integer numbers The sequence is defined as: xn+1 = (a xn + c) mod m where: m = 248 a = 25214903917 = 5DEECE66D (hex) c = 11 = B (hex) man drand48 for further information! Those numbers give a uniform distribution Luca Lista Statistical Methods for Data Analysis

Pseudo-random generators To convert into a floating-point number, just divide the integer by 248. The result will be uniformly distributed from 0 to 1 (with precision 1/248) drand48, mrand48, lrand48 return random numbers with different precision using a sufficiently large number of bits from the main integer sequence Luca Lista Statistical Methods for Data Analysis

Random generators in ROOT TRandom (low period: 109) TRandom1 (‘Ranlux’, F.James) TRandom2 (period: 1026) TRandom3 (period: 219937-1) ROOT::Math generators GSL based, relatively new See dedicated slides Luca Lista Statistical Methods for Data Analysis

Probability distribution Within precision, the distribution is uniform (flat) n / r r = drand48() Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Non uniform sequences In order to obtain a Gaussian distribution: average many numbers with any limited distribution Central limit theorem r = 0; for ( int i = 0; i < n; i++ ) r += drand48(); r /= n; Works, but inefficient! Luca Lista Statistical Methods for Data Analysis

Distribution of 1/ni=1,n ri Luca Lista Statistical Methods for Data Analysis

Comparison with true Gaussians Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Generate a known PDF Given a PDF: Its cumulative distribution is defined as: Luca Lista Statistical Methods for Data Analysis

Inverting the cumulative If the inverse of the cumulative distribution is known (or easily computable numerically) a variable x defined as: x = F-1(r) is distributed according to the PDF f(x) if r is uniformly distributed between 0 and 1 Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Demonstration As r = F(x), then: hence: If r has a uniform distribution, then dP/dr = 1, hence dP/dx = f(x) Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Example Exponential distribution: Normalization: 1-r and r have both uniform distribution between 0 and 1 Luca Lista Statistical Methods for Data Analysis

Generate uniformly over a sphere Generate  and . Factorize the PDF: Luca Lista Statistical Methods for Data Analysis

Generating Gaussian numbers Gaussian cumulative not easily invertible (erf) Solution: Generate simultaneously two independently Gaussian numbers From the inversion of 2D radial cumulative function: Box-Muller transformation: float r = sqrt(-2*log(drand48()); float phi = 2*pi*drand48(); float y1 = r*cos(phi), y2 = r*sin(phi); Other faster alternative are available (e.g.: Ziggurat) Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Hit or miss Monte Carlo Reproduce a generic distribution: Extract x flat from a to b Compute f = f(x) Extract r from 0 to m, where m  maxx f(x) If r > f repeat extraction, if r < f accept In this way, the density is proportional to f(x) May be inefficient if the function is very peaked! Finding maximum of f may be slow in many dimensions f(x) m miss hit a b x Luca Lista Statistical Methods for Data Analysis

Example: compute an integral double f(double x){ return pow(sin(x)/x, 2); } int main() { const double a = 0, b = 3.141592654, m = 1; int tot = 0; for(int i = 0; i < 10000; ++i) { do { double x = a + (b – a) * drand48(); double ff = f(x); ++tot; double r = drand48() * m; } while (r > ff); double ratio = double(hit)/double(tot); double error = sqrt(ratio * (1 – ratio)/tot); double area = (b – a) * m * ratio; return 0; Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Importance sampling The same method can be repeated in different regions: Extract x in one of the regions (1), (2), or (3) with prob. proportional to the areas Apply hit-or-miss in the randomly chosen region The density is still prop. to f(x), but a smaller number of extraction is sufficient (and the program runs faster!) Variation: use hit or miss within an “envelope” PDF whose cumulative has is easily invertible… f(x) m 2 3 1 a0 a1 a2 a3 x Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis Exercise Generate according to the following distribution (0  x <): Luca Lista Statistical Methods for Data Analysis

Estimate the error on MC integral MC can also be a mean to estimate integrals Accepting n over N extractions, binomial distribution can be applied: n2 = N(1- ) Where  = n/N is the best estimate of . The error on the estimate of  is:  2 = n/N 2 = (1- )/N Luca Lista Statistical Methods for Data Analysis

Multi-dimensional integral estimates The same Monte Carlo technique can be applied for multi-dimensional integral estimates, extracting independently the N coordinates (x1, …, xn) The error is always proportional to 1/N, regardless of the dimension N This is and advantage w.r.t. the standard numerical integration Difficulties: Finding maximum of f numerically may be slow in many dimensions Partitioning the integration range (importance sampling) may be non trivial to do automatically Luca Lista Statistical Methods for Data Analysis

Statistical Methods for Data Analysis References Logistic map, bifurcation and chaos http://en.wikipedia.org/wiki/Logistic_map PDG: review of random numbers and Monte Carlo http://pdg.lbl.gov/2001/monterpp.pdf GENBOD: phase space generator F. James, Monte Carlo Phase Space, CERN 68-15 (1968) Luca Lista Statistical Methods for Data Analysis