Sampling Methods  Sampling refers to how observations are “selected” from a probability distribution when the simulation is run. 1.

Slides:



Advertisements
Similar presentations
Monte Carlo Methods and Statistical Physics
Advertisements

Week11 Parameter, Statistic and Random Samples A parameter is a number that describes the population. It is a fixed number, but in practice we do not know.
Statistical Estimation and Sampling Distributions
Ch. 19 Unbiased Estimators Ch. 20 Efficiency and Mean Squared Error CIS 2033: Computational Probability and Statistics Prof. Longin Jan Latecki Prepared.
Chapter 5 Discrete Random Variables and Probability Distributions
Chapter 4 Mathematical Expectation.
Random number generation Algorithms and Transforms to Univariate Distributions.
Lecture 3 Probability and Measurement Error, Part 2.
Graduate School of Information Sciences, Tohoku University
FIN 685: Risk Management Topic 5: Simulation Larry Schrenk, Instructor.
Review of Basic Probability and Statistics
Simulation Modeling and Analysis
Discrete Event Simulation How to generate RV according to a specified distribution? geometric Poisson etc. Example of a DEVS: repair problem.
Estimation of parameters. Maximum likelihood What has happened was most likely.
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
Statistics.
Probability By Zhichun Li.
Overview of STAT 270 Ch 1-9 of Devore + Various Applications.
A random variable that has the following pmf is said to be a binomial random variable with parameters n, p The Binomial random variable.
Chapter 21 Random Variables Discrete: Bernoulli, Binomial, Geometric, Poisson Continuous: Uniform, Exponential, Gamma, Normal Expectation & Variance, Joint.
Introduction to ModelingMonte Carlo Simulation Expensive Not always practical Time consuming Impossible for all situations Can be complex Cons Pros Experience.
Monte Carlo Simulation 1.  Simulations where random values are used but the explicit passage of time is not modeled Static simulation  Introduction.
Computer Simulation A Laboratory to Evaluate “What-if” Questions.
Lecture 7: Simulations.
1 Ch5. Probability Densities Dr. Deshi Ye
 1  Outline  stages and topics in simulation  generation of random variates.
2.1 Random Variable Concept Given an experiment defined by a sample space S with elements s, we assign a real number to every s according to some rule.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Monte Carlo Simulation and Personal Finance Jacob Foley.
Monte Carlo Simulation CWR 6536 Stochastic Subsurface Hydrology.
Copyright © 2010 Lumina Decision Systems, Inc. Monte Carlo Simulation Analytica User Group Modeling Uncertainty Series #3 13 May 2010 Lonnie Chrisman,
Chapter 14 Monte Carlo Simulation Introduction Find several parameters Parameter follow the specific probability distribution Generate parameter.
1 Basic probability theory Professor Jørn Vatn. 2 Event Probability relates to events Let as an example A be the event that there is an operator error.
Discrete Distributions The values generated for a random variable must be from a finite distinct set of individual values. For example, based on past observations,
 A probability function is a function which assigns probabilities to the values of a random variable.  Individual probability values may be denoted by.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 1 Simulation.
SUPPLEMENT TO CHAPTER NINETEEN Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 SIMULATION 19S-1 Chapter 19 Supplement Simulation.
Ch5. Probability Densities II Dr. Deshi Ye
Lecture 19 Nov10, 2010 Discrete event simulation (Ross) discrete and continuous distributions computationally generating random variable following various.
“ Building Strong “ Delivering Integrated, Sustainable, Water Resources Solutions Statistics 101 Robert C. Patev NAD Regional Technical Specialist (978)
Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 5 Discrete Random Variables.
Delivering Integrated, Sustainable, Water Resources Solutions Monte Carlo Simulation Robert C. Patev North Atlantic Division – Regional Technical Specialist.
Outline of Chapter 9: Using Simulation to Solve Decision Problems Real world decisions are often too complex to be analyzed effectively using influence.
Basic Numerical Procedures Chapter 19 1 Options, Futures, and Other Derivatives, 7th Edition, Copyright © John C. Hull 2008.
Monté Carlo Simulation  Understand the concept of Monté Carlo Simulation  Learn how to use Monté Carlo Simulation to make good decisions  Learn how.
Probability Refresher COMP5416 Advanced Network Technologies.
Computer Simulation. The Essence of Computer Simulation A stochastic system is a system that evolves over time according to one or more probability distributions.
Expectation. Let X denote a discrete random variable with probability function p(x) (probability density function f(x) if X is continuous) then the expected.
POSC 202A: Lecture 4 Probability. We begin with the basics of probability and then move on to expected value. Understanding probability is important because.
Random Variable The outcome of an experiment need not be a number, for example, the outcome when a coin is tossed can be 'heads' or 'tails'. However, we.
Learning Simio Chapter 10 Analyzing Input Data
Computer simulation Sep. 9, QUIZ 2 Determine whether the following experiments have discrete or continuous out comes A fair die is tossed and the.
Sampling and estimation Petter Mostad
MAT 4830 Mathematical Modeling 04 Monte Carlo Integrations
Gil McVean, Department of Statistics Thursday February 12 th 2009 Monte Carlo simulation.
Engineering Probability and Statistics - SE-205 -Chap 3 By S. O. Duffuaa.
Chapter 4 Discrete Random Variables and Probability Distributions
Modeling and Simulation CS 313
Computer Simulation Henry C. Co Technology and Operations Management,
Statistical Modelling
Discrete Probability Distributions
STATISTICAL INFERENCE
IEE 380 Review.
Engineering Probability and Statistics - SE-205 -Chap 3
Modeling and Simulation CS 313
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
VQMC J. Planelles.
CS723 - Probability and Stochastic Processes
Discrete Random Variables and Probability Distributions
Mathematical Expectation
Presentation transcript:

Sampling Methods  Sampling refers to how observations are “selected” from a probability distribution when the simulation is run. 1

Sampling Methods  2

 Pure random sampling. The quantity of interest is a function of N random variables X 1,…,X N. That is we are interested in the function The random variables X 1,…,X N follow some joint distribution F. 3

Sampling Methods  Random sampling generates an observation “randomly” from F. What observations are more likely?  Depending on the number of trials you may or may not observe values in the “tails”. 4

Latin Hypercube Sampling  5

 The range of each random variable X 1,…,X N is divided up into n equal probability non- overlapping intervals.  E.g., normal, uniform, exponential.

Latin Hypercube Sampling  Generate an observation from each interval using the conditional distribution.  Example – Uniform.  Do this for all X 1,…,X N.

Latin Hypercube Sampling  8

 One value from each of the n observations are randomly matched to form a realization of  Example with 2 random variables (n = 5). 9

Latin Hypercube Sampling  Crystal Ball demo. 10

Sampling Methods  Random sampling will always work and may give you a better idea of the variability you may observe.  Latin hypercube sampling should give better estimates of mean values (less variance). May not observe much improvement as the number of random components increases. 11

Monte Carlo Simulation Applications  The evaluation of probability modeling problems 12

Probability Modeling 1.Containers of boxes are delivered to the receiving area of retail business and the boxes must be placed in a temporary storage facility until they can be moved to store shelves. There is one delivery every two days. Each container in a delivery contains the same number of boxes, which are taken out of the container and stored on the floor. A box requires 4 sq. ft. of storage space and can be stacked no more than two-high. The number of boxes in a container (the same for all containers in a delivery) follows a discrete uniform distribution with minimum = 8, and maximum = 16. The number of containers in a delivery has a Poisson distribution with a mean = 5. What is the expected value and variance of the storage space required for a delivery? For a Poisson random variable X, E[X] = Var[X]. Clearly state any assumptions you make. 13

14

Probability Modeling 2.p denotes the probability that an inspected part in a lot of parts is defective and is independent of the other parts. A lot of parts contains 100 parts and an inspector inspects every part in the lot. It takes T time units to inspect a single part and T ~ Uniform[a,b]. If a defective part is discovered an additional R time units is required to prepare the defective to be returned and R ~ Uniform[c,d]. What is the expected value and variance of the time required to complete the inspection of a lot? 15

16

Developing Monte Carlo Simulations  A certain amount of “art” or creativity within the constraints of the software being used is required.  Crystal Ball/Excel examples Integration Generating points distributed uniformly in a circle Stochastic Project Network 17

Integration  Developed by Manhattan Project scientists near the end of WWII.  A-Bomb development.  Will consider a simple example. Applied to more complex integration where other numerical methods do not work as well. 18

Integration 19

Integration 20

Integration  To estimate I use Monte Carlo simulation 21

Crystal Ball Example 22

Generating Points Uniformly in a Circle  HW #2 Consider the x-y plane and a circle of radius = 1, centered at x=2, y=2. An algorithm for generating random points within this circle is as follows:  This does not work. 23

In-Class Exercise  Devise a general approach to generate points uniformly distributed in the circle. Hint – Generate points uniformly in a square first. 24

Stochastic Project Network  A project network is used to depict the various milestones in a project, the activities needed to achieve the milestones, and the precedence relationships between milestones

Stochastic Project Network  26

Stochastic Project Network  A general n-node simulation model can be developed in Excel.  Need a general method to represent arbitrary n-node networks.  27

Stochastic Project Network

In-class Exercise  Generate the node-arc incidence matrix for the following network

In-class Exercise 30

31

32

33

Stochastic Project Network -Demo 34