1 / 10

Stochastic Simulation: Generating Realizations of Random Variables and Analyzing System Responses

This presentation covers the concept of stochastic simulation, which involves creating specific situations using models to study their responses and interpreting them in terms of real-world scenarios. It explains how to generate realizations of random variables with specified distributions using pseudo-random number generators. It also explores the simulation of continuous random variables and demonstrates the simulation of exponential and other distributions. Additionally, it introduces the concept of work in a system and its relationship to waiting times in a single server queue.

tatyanae
Download Presentation

Stochastic Simulation: Generating Realizations of Random Variables and Analyzing System Responses

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MATH 3033 based onDekking et al. A Modern Introduction to Probability and Statistics. 2007 Slides by Sean Hercus Instructor Longin Jan LateckiCh. 6 Simulations

  2. What is a simulation? One uses a model to create specific situations in order to study the response of the model to them and then interprets this in terms of what would happen to the system “in the real world”. Models for such systems involve random variables, and we speak of probabilistic or stochastic models, and simulating them is stochastic simulation. Stochastic simulation of a system means generating values for all the random variables in the model, according to their specified distributions, and recording and analyzing what happens We refer to the generated values as realizations of the random variables

  3. 6.2 Generating realizations Simulations are almost always done by computer, which usually have one or more so-called (pseudo) random number generators. Which mimics U(0,1). Ex: How do you simulate a coin toss with a die. Bernoulli random Variables Suppose U has a U(0,1) distribution. To construct a Ber(p) random variable for some 0 < p < 1. so that

  4. 6.2 cont. Continuous Random Variables Suppose you have a distribution function F of a continuous random variable and you wish to construct a random variable with this distribution. If distribution F is one-to-one from 0 to 1 then F has an inverse denoted Finv: F(x) = u ↔ x = Finv(u) Now instead of a real number u, replace u with a U(0,1) random variable U {U ≤ F(x)} = {Finv(U) ≤ x} => P(U ≤ F(x)) = P(Finv(U) ≤ x) = F(x) where 0 ≤ F(x) ≤ 1

  5. 6.2 cont.Exponential random variables Applying this method to exponential distribution F(x) = 1 – e-λx if U has a U(0,1) distribution, then the random variable X is defined by So we simulated a Exp(λ) random variable using a U(0,1) random variable F(x) = u ↔ x = ln (1- u) = Finv(u) X = Finv(U) = ln (1- U) = ln (U)

  6. 6.2 cont. The restriction imposed earlier that the distribution function should be strictly increasing, is not really necessary. Furthermore, a distribution function can have jump discontinuities or flat sections as well. Ex 6.3 If F has a jump discontinuity at a, then P(X = a) = the size of the jump If F has a flat section on [x1,x2], then P(U = F(x)) on the flat section = 0 and Finv(F(x)) = any x on [x1,x2] See figure 6.2 Random number generators create realizations for a large number of random variables which mimics U(0,1). The sequence of U(0,1) random variables U1,U2,… Have the property that the events {Ui ≤ ai} are independent for all ai

  7. 6.4 A single server queue There is a well and people want to determine how powerful of a pump they should buy. The more power would mean less wait times but also increased cost Let Ti represent the time between consecutive customers, called interarrival time, e.g., the time between customer 1 and 2 is T2. Let Si be the length of time that customer i needs to use the pump The pump capacity v (liters per minute) is a model parameter that we wish to determine. If customer i requires Ri liters of water, then Si = Ri / v To complete the model description, we need to specify the distribution of T and R Interarrival times: every Ti has an Exp(0.5) distribution (minutes) Service requirement: every Ri has U(2,5) distribution (liters)

  8. 6.4 cont Wi denotes the waiting time of customer i, for customer W1 = 0 since he doesn’t have to wait. Then the following waiting times depend on customer i-1: Wi = max{Wi-1 + Si-1 + Ti, 0} See pg.81 We are interested in average waiting time: This is used for fig 6.7, which is the plot of (n, n) for n = 1,2,… The average wait time for v = 2 turns out to be around 2 minutes The average wait time for v = 3 turns out to be around .5 minutes n=

  9. 6.4 Work in system One approach to determining how busy the pump is at any one time is to record at every moment how much work there is in the system. For example if I am halfway through filling my 4 liter container and 3 people are waiting who require 2, 3, and 5 liters, then there are 12 liters to go; at v = 2, there are 6 minutes of work in the system and at v = 3 there is just 4. The amount of work in the system just before a customer arrives equals the waiting time of the customer, this is also called virtual waiting time. Figures 6.8 and 6.9 illustrate the work in the system for v = 2 and v = 3

More Related