Slides 3: Random Numbers
|
|
- Milo Sutton
- 6 years ago
- Views:
Transcription
1 Slides 3: Random Numbers We previously considered a few examples of simulating real processes. In order to mimic real randomness of events such as arrival times we considered the use of random numbers that indicated what value the events will take. Today we will examine more closely how such numbers can be obtained and what they really represent. 1
2 Random Number Generator A random number generator (RNG) is a computational or physical device designed to generate a sequence of numbers that appear random. By random, it means that they do not exhibit any discernible pattern, no matter how much effort we put into finding one. In other words, successively generated numbers can not be predicted. 2
3 Historical Generation Historical methods of generating random numbers include: Dice throwing. Coin Flipping. Shuffling of playing cards. But these are mechanical and generating large amounts of sufficiently random numbers would require a large amount of work and/or time. Alternatively results can be collected and passed out as random number tables. 3
4 Modern Generation With the advent of computers there are several techniques to quickly generate random numbers. However, computers are deterministic machines, and can not act in a random manner. Yet they can generate numbers in such a complex manner that, to all intents and purposes, the successive numbers are unpredictable with no discernible pattern. 4
5 Standard Random Numbers Two important statistical properties: Uniformity. Independence. Random number R i must be independently drawn from a uniform distribution with pdf: f(x) = 1 if 0 x 1 0 otherwise. 5
6 Generation of Pseudo-Random Numbers Pseudo because generating numbers using a known method removes the potential for true randomness. Goal: To produce a sequence of numbers in [0,1] that simulates, or imitates, the ideal properties of random numbers. Important considerations in random number routines: Fast. Portable to different computers. Have sufficiently long cycle. Replicable. Closely approximate the ideal statistical properties of uniformity and independence. 6
7 Techniques for Generating Random Numbers Linear Congruential Method (LCM). Combined Linear Congruential Generators (CLGM). Random-Number Streams. 7
8 Linear Congruential Method To produce a sequence of integers X 1,X 2,... between 0 and m 1 by following a recursive relationship: X i+1 = (ax i +c) mod m,i = 0,1,2,... m is the modulus, 0 < a < m is the multiplier, and 0 c < m is the increment. The selection of a,c,m and X 0 drastically affects the statistical properties of the cycle length. The random integers are being generated in [0,m 1], so to convert the integers to random numbers: R i = X i /m,i = 1,2,... If c = 0 also known as a multiplicative congruential generator. 8
9 Example LCM Use X 0 = 27, a = 17, c = 43 and m = 100. The X i and R i values are: X 1 = ( ) mod 100 = 502 mod 100 = 2 so R 1 = X 2 = ( ) mod 100 = 77 so R 2 = X 3 = ( ) mod 100 = 1352 mod 100 = 52 so R 3 = and so on... 9
10 Characteristics of a Good Generator Maximum Density: Such that the values assumed by R i, i = 1,2,... have no large gaps on [0,1]. Problem: Instead of continuous, each R i is discrete. Solution: a very large integer for modulus m (approximation appears to be of little consequence). Maximum Period: To achieve maximum density and avoid cycling. Achieve by: proper choice of a,c,m and X 0, though maximum is m. Most digital computers use a binary representation of numbers: Speed and efficiency are aided by a modulus m to be (or close to) a power of 2. 10
11 Combined Linear Congruential Generators Reason: Longer period generator is needed because of the increasing complexity of simulated systems. Approach: Combine two or more multiplicative congruential generators. Let X i,1,x i,2,...,x i,k be the i-th output from k different multiplicative congruential generators: The j-th generator should: Have a prime modulus m j and a multiplier a j that ensures the period is m j 1. Produces integers X i,j which are approximately Uniform on integers in [1,m 1]. 11
12 Combined Linear Congruential Generators Suggested form: X i = ( k ) ( 1) j 1 X i,j mod (m 1 1) j=1 The returned value is: R i = X i /m 1 if X i > 0 (m 1 1)/m 1 if X i = 0. The maximum possible period is: p = (m 1 1)(m 2 1) (m k 1) 2 k 1 12
13 Combined Linear Congruential Generators Example: For 32-bit computers, one suggestion is to combine k = 2 generators with m 1 = 2,147,483,563, a 1 = 40,014, m 2 = 2,147,483,399 and a 2 = 40,692. The algorithm becomes: Step 1: Select seeds: X 1,0 in the range [1, ] for the first generator. X 2,0 in the range [1, ] for the second generator. Step 2: For each individual generator: X 1,j+1 = 40014X 1,j mod X 2,j+1 = 40692X 2,j mod Step 3: X j+1 = (X 1,j+1 X 2,j+1 ) mod
14 Combined Linear Congruential Generators Cont. Step 4: Return: R j+1 = X j+1 / if X j+1 > / if X j+1 = 0. Step 5: Set j = j +1 and return to step 2. Combined generator has period (m 1 1)(m 2 1)/
15 Random-Number Streams The seed for a linear congruential random-number generator: Is the integer value X 0 that initializes the random-number sequence. Any value in the sequence can be used to seed the generator. A random-number stream: Refers to a starting seed taken from the sequence X 0,X 1,...,X p. If the streams are b values apart, then stream i could be defined by starting at seed S i = X b(i 1). Older generators had b = 10 5, newer generators have b = A single random-number generator with k streams can act like k distinct virtual random-number generators. To compare two or more alternative systems: Advantageous to dedicate portions of the pseudo-random number sequence to the same purpose in each of the simulated systems. 15
16 Two categories: Tests for Random Numbers Testing for uniformity: H 0 : R i U[0,1] H 1 : R i U[0,1] Failure to reject the null hypothesis H 0 means that evidence of non-uniformity has not been detected. Testing for independence: H 0 : R i independently H 1 : R i independently Failure to reject the null hypothesis H 0 means that evidence of dependence has not been detected. Level of significance α, the probability of rejecting H 0 when it is true: α = P(reject H 0 H 0 true) 16
17 Tests for Random Numbers When to use these tests: If a well-known random-number generator is used, it is probably unnecessary to test. If the generator is not explicitly known or documented, e.g., spreadsheet programs, symbolic/numerical calculators, tests should be applied to many sample numbers. Types of tests: Theoretical tests: evaluate the choices of m, a and c without actually generating any numbers. Empirical tests: applied to actual sequences of numbers produced (what we will consider). 17
18 Frequency Tests Test of uniformity. Two different methods: Kolmogorov-Smirnov test. Chi-square test. 18
19 Kolmogorov-Smirnov Test Compares the continuous cdf, F(x), of the uniform distribution with the empirical cdf, S N (x), of the N sample observations: We know F(x) = x for 0 x 1. If the sample from the random number generator is R 1,R 2,...,R N, then the empirical cdf, S N (x) is: S N (x) = # of R 1,R 2,...,R N which are x N Based on the statistic: D = max F(x) S N (x). Sampling distribution of D is known (a function of N and available in tables). It is a more powerful test, hence recommended. 19
20 Kolmogorov-Smirnov Test Example: Suppose 5 generated numbers are 0.44, 0.81, 0.14, 0.05,
21 Kolmogorov-Smirnov Test Step 1: Arrange R (i) from smallest to largest. Step 2: Calculate i/n. Step 3: Calculate i/n R (i) Step 4: Calculate R (i) (i 1)/N 21
22 Kolmogorov-Smirnov Test Step 5: Set D + = max{i/n R (i) }. Step 6: Set D = max{r (i) (i 1)/N}. Step 4: Set D = max{d +,D } = For α = 0.05, D α = > D, hence H 0 not rejected. 22
23 Chi-square Test Chi-square test uses the sample statistic: χ 2 0 = n i=1 (O i E i ) 2 E i Here n is the number of classes, E i is the expected number in the i-th class, and O i is the observed number in the i-th class. Approximately the chi-square distribution with n 1 degrees of freedom (where critical values are available in tables). For the uniform distribution E i, the expected number in each class, is N/n, where N is the total number of observations. Only valid for large samples, e.g., N
24 Tests for Autocorrelation Testing the autocorrelation between every m numbers (m is a.k.a. the lag), starting with the i-th number: The autocorrelation ρ i,m between numbers: R i,r i+m,r i+2m,...,r i+(m+1)m. Here M is the largest integer such that i+(m +1)m N. Hypothesis: H 0 : ρ i,m = 0, if numbers are independent If the values are uncorrelated: H 1 : ρ i,m 0, if numbers are dependent For large values of M, the distribution of the estimator ρ i,m, denoted ˆρ i,m is approximately normal. 24
25 Tests for Autocorrelation Test statistic is Z 0 = ˆρ i,m /ˆσˆρi,m. Z 0 is distributed normally with mean 0 and variance 1 and: ˆρ i,m = 1 ( M R i+km R i+(k+1)m ) 0.25 M +1 k=0 ˆσˆρi,m = 13M +7 12(M +1) If ρ i,m > 0, the subsequence has positive autocorrelation (high random numbers tend to be followed by high ones, and vice versa). If ρ i,m < 0, the subsequence has negative autocorrelation (high random numbers tend to be followed by low ones, and vice versa). 25
26 Shortcomings The test is not very sensitive for small values of M, particularly when the numbers being tested are on the low side. Problem when fishing for autocorrelation by performing numerous tests: If α = 0.05, there is a probability of 0.05 of rejecting a true hypothesis. If 10 independent sequences are examined: The probability of finding no significant autocorrelation, by chance alone, is Hence, the probability of detecting significant autocorrelation when it does not exist is 40%. 26
27 Summary We have examined generation of random numbers and tests for uniformity and independence. Caution: Even generators that have been used for years, some of which are still in use, can often be found to be inadequate in practice. We have only covered very basic generators and tests. Also, even if generated numbers pass all the tests, some underlying pattern may still have gone undetected. 27
Systems Simulation Chapter 7: Random-Number Generation
Systems Simulation Chapter 7: Random-Number Generation Fatih Cavdur fatihcavdur@uludag.edu.tr April 22, 2014 Introduction Introduction Random Numbers (RNs) are a necessary basic ingredient in the simulation
More informationB.N.Bandodkar College of Science, Thane. Random-Number Generation. Mrs M.J.Gholba
B.N.Bandodkar College of Science, Thane Random-Number Generation Mrs M.J.Gholba Properties of Random Numbers A sequence of random numbers, R, R,., must have two important statistical properties, uniformity
More informationUNIT 5:Random number generation And Variation Generation
UNIT 5:Random number generation And Variation Generation RANDOM-NUMBER GENERATION Random numbers are a necessary basic ingredient in the simulation of almost all discrete systems. Most computer languages
More informationCPSC 531: Random Numbers. Jonathan Hudson Department of Computer Science University of Calgary
CPSC 531: Random Numbers Jonathan Hudson Department of Computer Science University of Calgary http://www.ucalgary.ca/~hudsonj/531f17 Introduction In simulations, we generate random values for variables
More informationUniform random numbers generators
Uniform random numbers generators Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2707/ OUTLINE: The need for random numbers; Basic steps in generation; Uniformly
More informationRandom Number Generation. CS1538: Introduction to simulations
Random Number Generation CS1538: Introduction to simulations Random Numbers Stochastic simulations require random data True random data cannot come from an algorithm We must obtain it from some process
More informationIE 303 Discrete-Event Simulation L E C T U R E 6 : R A N D O M N U M B E R G E N E R A T I O N
IE 303 Discrete-Event Simulation L E C T U R E 6 : R A N D O M N U M B E R G E N E R A T I O N Review of the Last Lecture Continuous Distributions Uniform distributions Exponential distributions and memoryless
More informationSources of randomness
Random Number Generator Chapter 7 In simulations, we generate random values for variables with a specified distribution Ex., model service times using the exponential distribution Generation of random
More informationIndependent Events. Two events are independent if knowing that one occurs does not change the probability of the other occurring
Independent Events Two events are independent if knowing that one occurs does not change the probability of the other occurring Conditional probability is denoted P(A B), which is defined to be: P(A and
More informationHow does the computer generate observations from various distributions specified after input analysis?
1 How does the computer generate observations from various distributions specified after input analysis? There are two main components to the generation of observations from probability distributions.
More informationHow does the computer generate observations from various distributions specified after input analysis?
1 How does the computer generate observations from various distributions specified after input analysis? There are two main components to the generation of observations from probability distributions.
More informationTopics in Computer Mathematics
Random Number Generation (Uniform random numbers) Introduction We frequently need some way to generate numbers that are random (by some criteria), especially in computer science. Simulations of natural
More information2008 Winton. Review of Statistical Terminology
1 Review of Statistical Terminology 2 Formal Terminology An experiment is a process whose outcome is not known with certainty The experiment s sample space S is the set of all possible outcomes. A random
More informationB. Maddah ENMG 622 Simulation 11/11/08
B. Maddah ENMG 622 Simulation 11/11/08 Random-Number Generators (Chapter 7, Law) Overview All stochastic simulations need to generate IID uniformly distributed on (0,1), U(0,1), random numbers. 1 f X (
More informationLehmer Random Number Generators: Introduction
Lehmer Random Number Generators: Introduction Revised version of the slides based on the book Discrete-Event Simulation: a first course LL Leemis & SK Park Section(s) 21, 22 c 2006 Pearson Ed, Inc 0-13-142917-5
More informationGenerating Uniform Random Numbers
1 / 41 Generating Uniform Random Numbers Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/13/16 2 / 41 Outline 1 Introduction 2 Some Lousy Generators We Won t
More informationReview of Statistical Terminology
Review of Statistical Terminology An experiment is a process whose outcome is not known with certainty. The experiment s sample space S is the set of all possible outcomes. A random variable is a function
More informationGenerating Uniform Random Numbers
1 / 44 Generating Uniform Random Numbers Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/29/17 2 / 44 Outline 1 Introduction 2 Some Lousy Generators We Won t
More informationGenerating Uniform Random Numbers
1 / 43 Generating Uniform Random Numbers Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA March 1, 2016 2 / 43 Outline 1 Introduction 2 Some Generators We Won t
More informationSo far we discussed random number generators that need to have the maximum length period.
So far we discussed random number generators that need to have the maximum length period. Even the increment series has the maximum length period yet it is by no means random How do we decide if a generator
More informationISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16)
1 NAME ISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16) This test is 85 minutes. You are allowed two cheat sheets. Good luck! 1. Some short answer questions to get things going. (a) Consider the
More informationComputer Applications for Engineers ET 601
Computer Applications for Engineers ET 601 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th Random Variables (Con t) 1 Office Hours: (BKD 3601-7) Wednesday 9:30-11:30 Wednesday 16:00-17:00 Thursday
More informationAlgorithms and Networking for Computer Games
Algorithms and Networking for Computer Games Chapter 2: Random Numbers http://www.wiley.com/go/smed What are random numbers good for (according to D.E. Knuth) simulation sampling numerical analysis computer
More informationGenerating Random Variables
Generating Random Variables These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable copy and print a single
More informationChapter 7 Random Numbers
Chapter 7 Random Numbers February 15, 2010 7 In the following random numbers and random sequences are treated as two manifestations of the same thing. A series of random numbers strung together is considered
More informationChapter 4: Monte Carlo Methods. Paisan Nakmahachalasint
Chapter 4: Monte Carlo Methods Paisan Nakmahachalasint Introduction Monte Carlo Methods are a class of computational algorithms that rely on repeated random sampling to compute their results. Monte Carlo
More informationWorkshop on Heterogeneous Computing, 16-20, July No Monte Carlo is safe Monte Carlo - more so parallel Monte Carlo
Workshop on Heterogeneous Computing, 16-20, July 2012 No Monte Carlo is safe Monte Carlo - more so parallel Monte Carlo K. P. N. Murthy School of Physics, University of Hyderabad July 19, 2012 K P N Murthy
More informationRandom number generation
CE 391F April 4, 2013 ANNOUNCEMENTS Homework 3 due today Homework 4 coming... Announcements Webinar announcement Femke van Wageningen-Kessels from TU Delft will be giving a webinar titled Traffic Flow
More informationPseudo-Random Generators
Pseudo-Random Generators Why do we need random numbers? Simulation Sampling Numerical analysis Computer programming (e.g. randomized algorithm) Elementary and critical element in many cryptographic protocols
More informationUniform Random Number Generators
JHU 553.633/433: Monte Carlo Methods J. C. Spall 25 September 2017 CHAPTER 2 RANDOM NUMBER GENERATION Motivation and criteria for generators Linear generators (e.g., linear congruential generators) Multiple
More informationPseudo-Random Generators
Pseudo-Random Generators Topics Why do we need random numbers? Truly random and Pseudo-random numbers. Definition of pseudo-random-generator What do we expect from pseudorandomness? Testing for pseudo-randomness.
More informationRandom processes and probability distributions. Phys 420/580 Lecture 20
Random processes and probability distributions Phys 420/580 Lecture 20 Random processes Many physical processes are random in character: e.g., nuclear decay (Poisson distributed event count) P (k, τ) =
More informationTopics. Pseudo-Random Generators. Pseudo-Random Numbers. Truly Random Numbers
Topics Pseudo-Random Generators Why do we need random numbers? Truly random and Pseudo-random numbers. Definition of pseudo-random-generator What do we expect from pseudorandomness? Testing for pseudo-randomness.
More informationPseudo-Random Numbers Generators. Anne GILLE-GENEST. March 1, Premia Introduction Definitions Good generators...
14 pages 1 Pseudo-Random Numbers Generators Anne GILLE-GENEST March 1, 2012 Contents Premia 14 1 Introduction 2 1.1 Definitions............................. 2 1.2 Good generators..........................
More informationStatistics, Data Analysis, and Simulation SS 2013
Mainz, May 2, 2013 Statistics, Data Analysis, and Simulation SS 2013 08.128.730 Statistik, Datenanalyse und Simulation Dr. Michael O. Distler 2. Random Numbers 2.1 Why random numbers:
More informationLecture 20. Randomness and Monte Carlo. J. Chaudhry. Department of Mathematics and Statistics University of New Mexico
Lecture 20 Randomness and Monte Carlo J. Chaudhry Department of Mathematics and Statistics University of New Mexico J. Chaudhry (UNM) CS 357 1 / 40 What we ll do: Random number generators Monte-Carlo integration
More informationH 2 : otherwise. that is simply the proportion of the sample points below level x. For any fixed point x the law of large numbers gives that
Lecture 28 28.1 Kolmogorov-Smirnov test. Suppose that we have an i.i.d. sample X 1,..., X n with some unknown distribution and we would like to test the hypothesis that is equal to a particular distribution
More informationMETHODS FOR GENERATION OF RANDOM NUMBERS IN PARALLEL STOCHASTIC ALGORITHMS FOR GLOBAL OPTIMIZATION
METHODS FOR GENERATION OF RANDOM NUMBERS IN PARALLEL STOCHASTIC ALGORITHMS FOR GLOBAL OPTIMIZATION Algirdas Lančinskas, Julius Žilinskas Institute of Mathematics and Informatics 1. Introduction Generation
More informationLesson 8: Testing for IID Hypothesis with the correlogram
Lesson 8: Testing for IID Hypothesis with the correlogram Dipartimento di Ingegneria e Scienze dell Informazione e Matematica Università dell Aquila, umberto.triacca@ec.univaq.it Testing for i.i.d. Hypothesis
More informationNotation Precedence Diagram
Notation Precedence Diagram xix xxi CHAPTER 1 Introduction 1 1.1. Systems, Models, and Simulation 1 1.2. Verification, Approximation, and Validation 8 1.2.1. Verifying a Program 9 1.2.2. Approximation
More informationProbability Distributions
02/07/07 PHY310: Statistical Data Analysis 1 PHY310: Lecture 05 Probability Distributions Road Map The Gausssian Describing Distributions Expectation Value Variance Basic Distributions Generating Random
More informationStochastic Simulation
Stochastic Simulation APPM 7400 Lesson 3: Testing Random Number Generators Part II: Uniformity September 5, 2018 Lesson 3: Testing Random Number GeneratorsPart II: Uniformity Stochastic Simulation September
More informationTHE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 004 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER II STATISTICAL METHODS The Society provides these solutions to assist candidates preparing for the examinations in future
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationModeling and Performance Analysis with Discrete-Event Simulation
Simulation Modeling and Performance Analysis with Discrete-Event Simulation Chapter 9 Input Modeling Contents Data Collection Identifying the Distribution with Data Parameter Estimation Goodness-of-Fit
More informationTitle:Varies statistical test of pseudorandom number generator
Master Project Title:Varies statistical test of pseudorandom number generator Mohammad shafiqul haque 2010-06-14 Subject: Mathematics Level: Advance Course code: 4MA11E Abstract This thesis is related
More informationChapte The McGraw-Hill Companies, Inc. All rights reserved.
er15 Chapte Chi-Square Tests d Chi-Square Tests for -Fit Uniform Goodness- Poisson Goodness- Goodness- ECDF Tests (Optional) Contingency Tables A contingency table is a cross-tabulation of n paired observations
More informationRandom numbers and generators
Chapter 2 Random numbers and generators Random numbers can be generated experimentally, like throwing dice or from radioactive decay measurements. In numerical calculations one needs, however, huge set
More informationRandom Numbers. Pierre L Ecuyer
1 Random Numbers Pierre L Ecuyer Université de Montréal, Montréal, Québec, Canada Random numbers generators (RNGs) are available from many computer software libraries. Their purpose is to produce sequences
More informationLecture 1: Random number generation, permutation test, and the bootstrap. August 25, 2016
Lecture 1: Random number generation, permutation test, and the bootstrap August 25, 2016 Statistical simulation 1/21 Statistical simulation (Monte Carlo) is an important part of statistical method research.
More informationStatistical Testing of Randomness
Statistical Testing of Randomness (Yesterday, Today, and Possibly Tomorrow) Jan Krhovják BUSLab & LaBAK Faculty of Informatics, Masaryk University, Brno LaBAK & KD Lab Seminar, Cikhákj, Spring 2007 1/26
More informationSimulation. Where real stuff starts
Simulation Where real stuff starts March 2019 1 ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3
More informationRandom number generators
s generators Comp Sci 1570 Introduction to Outline s 1 2 s generator s The of a sequence of s or symbols that cannot be reasonably predicted better than by a random chance, usually through a random- generator
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 8 Input Modeling Purpose & Overview Input models provide the driving force for a simulation model. The quality of the output is no better than the quality
More information2 P. L'Ecuyer and R. Simard otherwise perform well in the spectral test, fail this independence test in a decisive way. LCGs with multipliers that hav
Beware of Linear Congruential Generators with Multipliers of the form a = 2 q 2 r Pierre L'Ecuyer and Richard Simard Linear congruential random number generators with Mersenne prime modulus and multipliers
More informationStream Ciphers. Çetin Kaya Koç Winter / 20
Çetin Kaya Koç http://koclab.cs.ucsb.edu Winter 2016 1 / 20 Linear Congruential Generators A linear congruential generator produces a sequence of integers x i for i = 1,2,... starting with the given initial
More information2008 Winton. Statistical Testing of RNGs
1 Statistical Testing of RNGs Criteria for Randomness For a sequence of numbers to be considered a sequence of randomly acquired numbers, it must have two basic statistical properties: Uniformly distributed
More informationA TEST OF RANDOMNESS BASED ON THE DISTANCE BETWEEN CONSECUTIVE RANDOM NUMBER PAIRS. Matthew J. Duggan John H. Drew Lawrence M.
Proceedings of the 2005 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, eds. A TEST OF RANDOMNESS BASED ON THE DISTANCE BETWEEN CONSECUTIVE RANDOM NUMBER PAIRS
More informationStatistical Methods for Astronomy
Statistical Methods for Astronomy If your experiment needs statistics, you ought to have done a better experiment. -Ernest Rutherford Lecture 1 Lecture 2 Why do we need statistics? Definitions Statistical
More informationTae-Soo Kim and Young-Kyun Yang
Kangweon-Kyungki Math. Jour. 14 (2006), No. 1, pp. 85 93 ON THE INITIAL SEED OF THE RANDOM NUMBER GENERATORS Tae-Soo Kim and Young-Kyun Yang Abstract. A good arithmetic random number generator should possess
More informationStochastic Simulation of
Stochastic Simulation of Communication Networks -WS 2014/2015 Part 2 Random Number Generation Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 2-1 Table of Contents 1 General Introduction 2 Random Number
More informationBivariate Paired Numerical Data
Bivariate Paired Numerical Data Pearson s correlation, Spearman s ρ and Kendall s τ, tests of independence University of California, San Diego Instructor: Ery Arias-Castro http://math.ucsd.edu/~eariasca/teaching.html
More informationHypothesis Testing hypothesis testing approach
Hypothesis Testing In this case, we d be trying to form an inference about that neighborhood: Do people there shop more often those people who are members of the larger population To ascertain this, we
More informationI L L I N O I S UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN
Canonical Edps/Soc 584 and Psych 594 Applied Multivariate Statistics Carolyn J. Anderson Department of Educational Psychology I L L I N O I S UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN Canonical Slide
More informationCSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function
CSCE 564, Fall 2001 Notes 6 Page 1 13 Random Numbers The great metaphysical truth in the generation of random numbers is this: If you want a function that is reasonably random in behavior, then take any
More informationcse 311: foundations of computing Fall 2015 Lecture 12: Primes, GCD, applications
cse 311: foundations of computing Fall 2015 Lecture 12: Primes, GCD, applications n-bit unsigned integer representation Represent integer x as sum of powers of 2: If x = n 1 i=0 b i 2 i where each b i
More information( x) ( ) F ( ) ( ) ( ) Prob( ) ( ) ( ) X x F x f s ds
Applied Numerical Analysis Pseudo Random Number Generator Lecturer: Emad Fatemizadeh What is random number: A sequence in which each term is unpredictable 29, 95, 11, 60, 22 Application: Monte Carlo Simulations
More informationProbability Methods in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur
Probability Methods in Civil Engineering Prof. Dr. Rajib Maity Department of Civil Engineering Indian Institute of Technology, Kharagpur Lecture No. # 38 Goodness - of fit tests Hello and welcome to this
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 6 andom-variate Generation Purpose & Overview Develop understanding of generating samples from a specified distribution as input to a simulation model.
More informationMonte Carlo Techniques
Physics 75.502 Part III: Monte Carlo Methods 40 Monte Carlo Techniques Monte Carlo refers to any procedure that makes use of random numbers. Monte Carlo methods are used in: Simulation of natural phenomena
More informationcse 311: foundations of computing Fall 2015 Lecture 11: Modular arithmetic and applications
cse 311: foundations of computing Fall 2015 Lecture 11: Modular arithmetic and applications arithmetic mod 7 a + 7 b = (a + b) mod 7 a 7 b = (a b) mod 7 5 6 0 1 2 4 3 + 0 1 2 3 4 5 6 0 0 1 2 3 4 5 6 1
More informationS6880 #6. Random Number Generation #2: Testing RNGs
S6880 #6 Random Number Generation #2: Testing RNGs 1 Testing Uniform RNGs Theoretical Tests Outline 2 Empirical Tests for Independence Gap Tests Runs Test Coupon Collectors Test The Poker Test 3 Other
More informationClass 12. Random Numbers
Class 12. Random Numbers NRiC 7. Frequently needed to generate initial conditions. Often used to solve problems statistically. How can a computer generate a random number? It can t! Generators are pseudo-random.
More informationThe Chi-Square Distributions
MATH 183 The Chi-Square Distributions Dr. Neal, WKU The chi-square distributions can be used in statistics to analyze the standard deviation σ of a normally distributed measurement and to test the goodness
More informationFrom Random Numbers to Monte Carlo. Random Numbers, Random Walks, Diffusion, Monte Carlo integration, and all that
From Random Numbers to Monte Carlo Random Numbers, Random Walks, Diffusion, Monte Carlo integration, and all that Random Walk Through Life Random Walk Through Life If you flip the coin 5 times you will
More informationContents Kruskal-Wallis Test Friedman s Two-way Analysis of Variance by Ranks... 47
Contents 1 Non-parametric Tests 3 1.1 Introduction....................................... 3 1.2 Advantages of Non-parametric Tests......................... 4 1.3 Disadvantages of Non-parametric Tests........................
More informationEEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture
More informationPart 1.) We know that the probability of any specific x only given p ij = p i p j is just multinomial(n, p) where p k1 k 2
Problem.) I will break this into two parts: () Proving w (m) = p( x (m) X i = x i, X j = x j, p ij = p i p j ). In other words, the probability of a specific table in T x given the row and column counts
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationNumerical methods for lattice field theory
Numerical methods for lattice field theory Mike Peardon Trinity College Dublin August 9, 2007 Mike Peardon (Trinity College Dublin) Numerical methods for lattice field theory August 9, 2007 1 / 37 Numerical
More informationRandom Number Generators
1/18 Random Number Generators Professor Karl Sigman Columbia University Department of IEOR New York City USA 2/18 Introduction Your computer generates" numbers U 1, U 2, U 3,... that are considered independent
More information14.30 Introduction to Statistical Methods in Economics Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 4.0 Introduction to Statistical Methods in Economics Spring 009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationDUBLIN CITY UNIVERSITY
DUBLIN CITY UNIVERSITY SAMPLE EXAMINATIONS 2017/2018 MODULE: QUALIFICATIONS: Simulation for Finance MS455 B.Sc. Actuarial Mathematics ACM B.Sc. Financial Mathematics FIM YEAR OF STUDY: 4 EXAMINERS: Mr
More informationOutline. Simulation of a Single-Server Queueing System. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Outline Simulation of a Single-Server Queueing System Review of midterm # Department of Electrical and Computer Engineering
More informationIV. The Normal Distribution
IV. The Normal Distribution The normal distribution (a.k.a., the Gaussian distribution or bell curve ) is the by far the best known random distribution. It s discovery has had such a far-reaching impact
More informationAnalytical Methods. Session 3: Statistics II. UCL Department of Civil, Environmental & Geomatic Engineering. Analytical Methods.
Analytical Methods Session 3: Statistics II More statistical tests Quite a few more questions that we might want to ask about data that we have. Is one value significantly different to the rest, or to
More informationRandom Variate Generation
Random Variate Generation 28-1 Overview 1. Inverse transformation 2. Rejection 3. Composition 4. Convolution 5. Characterization 28-2 Random-Variate Generation General Techniques Only a few techniques
More informationST4241 Design and Analysis of Clinical Trials Lecture 7: N. Lecture 7: Non-parametric tests for PDG data
ST4241 Design and Analysis of Clinical Trials Lecture 7: Non-parametric tests for PDG data Department of Statistics & Applied Probability 8:00-10:00 am, Friday, September 2, 2016 Outline Non-parametric
More informationLecture on Null Hypothesis Testing & Temporal Correlation
Lecture on Null Hypothesis Testing & Temporal Correlation CS 590.21 Analysis and Modeling of Brain Networks Department of Computer Science University of Crete Acknowledgement Resources used in the slides
More information1.225J J (ESD 205) Transportation Flow Systems
1.225J J (ESD 25) Transportation Flow Systems Lecture 9 Simulation Models Prof. Ismail Chabini and Prof. Amedeo R. Odoni Lecture 9 Outline About this lecture: It is based on R16. Only material covered
More informationStochastic Simulation of Communication Networks
Stochastic Simulation of Communication Networks Part 2 Amanpreet Singh (aps) Dr.-Ing Umar Toseef (umr) (@comnets.uni-bremen.de) Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 2-1 Table of Contents 1
More informationSummary of Chapters 7-9
Summary of Chapters 7-9 Chapter 7. Interval Estimation 7.2. Confidence Intervals for Difference of Two Means Let X 1,, X n and Y 1, Y 2,, Y m be two independent random samples of sizes n and m from two
More informationA NEW RANDOM NUMBER GENERATOR USING FIBONACCI SERIES
International J. of Math. Sci. & Engg. Appls. (IJMSEA) ISSN 0973-9424, Vol. 11 No. I (April, 2017), pp. 185-193 A NEW RANDOM NUMBER GENERATOR USING FIBONACCI SERIES KOTTA NAGALAKSHMI RACHANA 1 AND SOUBHIK
More informationA Repetition Test for Pseudo-Random Number Generators
Monte Carlo Methods and Appl., Vol. 12, No. 5-6, pp. 385 393 (2006) c VSP 2006 A Repetition Test for Pseudo-Random Number Generators Manuel Gil, Gaston H. Gonnet, Wesley P. Petersen SAM, Mathematik, ETHZ,
More informationDepartment of Electrical- and Information Technology. ETS061 Lecture 3, Verification, Validation and Input
ETS061 Lecture 3, Verification, Validation and Input Verification and Validation Real system Validation Model Verification Measurements Verification Break model down into smaller bits and test each bit
More informationComputer simulation on homogeneity testing for weighted data sets used in HEP
Computer simulation on homogeneity testing for weighted data sets used in HEP Petr Bouř and Václav Kůs Department of Mathematics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University
More informationUniform Random Binary Floating Point Number Generation
Uniform Random Binary Floating Point Number Generation Prof. Dr. Thomas Morgenstern, Phone: ++49.3943-659-337, Fax: ++49.3943-659-399, tmorgenstern@hs-harz.de, Hochschule Harz, Friedrichstr. 57-59, 38855
More informationL2: Review of probability and statistics
Probability L2: Review of probability and statistics Definition of probability Axioms and properties Conditional probability Bayes theorem Random variables Definition of a random variable Cumulative distribution
More informationLecture 2 : CS6205 Advanced Modeling and Simulation
Lecture 2 : CS6205 Advanced Modeling and Simulation Lee Hwee Kuan 21 Aug. 2013 For the purpose of learning stochastic simulations for the first time. We shall only consider probabilities on finite discrete
More informationLing 289 Contingency Table Statistics
Ling 289 Contingency Table Statistics Roger Levy and Christopher Manning This is a summary of the material that we ve covered on contingency tables. Contingency tables: introduction Odds ratios Counting,
More information