PoissonprocessandderivationofBellmanequations

Size: px
Start display at page:

Download "PoissonprocessandderivationofBellmanequations"

Transcription

1 APPENDIX B PoissonprocessandderivationofBellmanequations 1 Poisson process Let us first define the exponential distribution Definition B1 A continuous random variable X is said to have an exponential distribution with parameter λ> if its cumulative distribution function (cdf) is given by: F (t) =P {X <t} =1 e λt for all t This implies that the probability density function (pdf) is equal to: f(t) =λe λt for all t The exponential distribution has mean Z+ E [X] = tf(t)dt = 1 λ and variance V [X] =E X 2 (E [X]) 2 = 1 λ 2 It is straightforward to show the following proposition: Proposition B1 The exponential distribution with parameter (or rate) λ> has the following properties: (i) Independence: P {X >t+ t } = P {X >t} P {X >t } (ii) Memoryless P {X >t+ t X>t} = P {X >t } t, t Observe that the exponential distribution is the unique distribution possessing the memoryless property Following Ross (1996), let us now define a counting process (and its properties) and then a Poisson process 395

2 396 B POISSON PROCESS AND DERIVATION OF BELLMAN EQUATIONS Definition B2 Let {X n, n 1} be a sequence of random variables representing the inter-event times Define S =, S n = X X n ThenS n is the time of occurrence of the nth event Define S(t) =max{n S n t}, t Thus S(t) represents the total number of events that have occurred up to time t A stochastic process {S(t), t } is called a counting process Definition B3 A counting process {S(t), t } is said to possess: (a) independent increments if the number of events which occur in disjoint intervals are independent, ie for t 1 t n, the increments S(t 1 ), S(t 2 ) S(t 1 ),, S(t n ) S(t n 1 ) are independent random variables (b) stationary increments if the distribution of the number of events which occur in any interval of time only depends the length of the time interval, ie the distribution of X(t + t ) X(t ) is independent of t A Poisson process is frequently used as a model for counting events occurring one at a time Let us now define formally a Poisson process Definition B4 The counting process {S(t), t } is said to be a Poisson process having rate λ>, if: (i) The process has stationary and independent increments; (ii) The number of events in any interval of length t is Poisson distributed with mean λt Thatis,forallt, λt (λt)n P {S(t) =n} = e, n! n =, 1, (B1) We have the following alternative definition: 1 Definition B5 Thecounting process{s(t), t } with S() = is said to be a Poisson process having rate λ>, if: (i) The process has stationary and independent increments; 1 A function f : R R is said to be an o(h) function if f(h) lim h h =

3 (ii) P {S(h) =1} P {S(t + h) S(t) =1} = λh + o(h); (iii) P {S(h) 2} P {S(t + h) S(t) 2} = o(h) 1 POISSON PROCESS 397 This definition helps us understand how randomness in time can be interpreted Condition (i) implies that what happens under non-overlapping time intervals is independent Condition (ii) states that rate λ is constant over time while condition (iii) says that two (or more) eventscannot occuratthesametime Ross (1996) shows that these two definitions (ie definitions B4 and B5) are equivalent Example B1 Consider a person who receives a lot of junk mails in his/her mailbox Assume that the number of junk mails follows a Poisson process having rate 2 per hour B11 What is the probability that no junk mail arrives between 9 am and 11 am? This probability is defined by P {S(11) S(9) = } UsingDefinition B4 and in particular equation (B1), we obtain (for λ =2): 2t (2t) P {S(11) S(9) = } = e! = e 2 2 = 183 Observe that, because of time homogeneity, this probability is the same as the probability that no junk mail arrives between 2: pm and 4: pm or any other times as long as there aretwohoursdifference B12 What is the expected number of junk mails that arrive during 8 hours? The expected number of junk mails that arrive during 8 hours is: E [S(8)] = λ 8=16 B13 What is the probability that one junk mail arrives between 1: pm and 2: pm and two junk mailsarrivebetween1:3pmand2:3pm? Using time homogeneity and using hours as units of time, let us start at t =(which corresponds to 1: pm here) so that 2: pm corresponds to t =1(here, 1 hour corresponds to 1 unit of time) Then, 1:3 pm corresponds to t =5 and 2:3 pm to t =15 Thus, the probability that one junk mail arrives between 1: pm and 2: pm and two junk mails arrive between 1:3 pm and 2:3 pm can be written as: P {S(1) = 1, S(15) S(5) = 2}

4 398 B POISSON PROCESS AND DERIVATION OF BELLMAN EQUATIONS Using the fact that increments over (, 5], (5, 1], and(1, 15] are independent, we can write the following: P {S(1) = 1, S(15) S(5) = 2} P = 1 P {S(5) = n, S(1) S(5) = 1 n, S(15) S(1) = 1 + n} n= Let us explain this last equation We divide time in three intervals: (, 5], (5, 1], and (1, 15], that is between 1: pm and 1:3 pm, 1:3 pm and 2: pm, 2: pm and 2:3 pm Then, in order to have 1 junk mail between t =(ie 1: pm) and t =1(ie 2: pm), it has to be that either no junk mail arrives between t =and t =5 (ie 1:3 pm) and 1 arrives between t =5 and t =1or 1 junk mailarrivesbetweent =and t =5 and arrives between t = 5 and t = 1 Similarly, in order to have 2 junk mails between t = 5 and t =15 (ie 2:3 pm), it has to be that either no junk mail arrives between t =5 and t =1and 2 arrive between t =1and t =15 or 2 junk mails arrive between t =5 and t =1and arrives between t =1and t =15 or 1 junk mail arrives between t =5 and t =1and 1 arrives between t =1and t =15 By combining all these possibilities, it hastobethat: P {S(1) = 1, S(15) S(5) = 2} = P {S(5) =, S(1) S(5) = 1, S(15) S(1) = 1} +P {S(5) = 1, S(1) S(5) =, S(15) S(1) = 2} In other words, either no junk mail arrives between t =and t =5 and 1 junk mail arrives both between t =5 and t =1and between t =1and t =15, or 1 junk mail arrives between t =and t =5, junk mailbetweent =5 and t =1and 2 between t =1and t =15

5 1 POISSON PROCESS 399 We have: 1P P {S(5) = n, S(1) S(5) = 1 n, S(15) S(1) = 1 + n} n= P = 1 P {S(5) = n} P {S(1) S(5) = 1 n} P {S(15) S(1) = 1 + n} n= P = 1 1 (1)n (1)1 n (1)1+n e e 1 e 1 n= n! (1 n)! (1 + n)! = e 3 P 1 1 n= n!(1 n)! (1 + n)! µ = e =15e 3 ' Consider a Poisson process {S(t), t } and denote the time of the first event by T 1 Moreover, for n>1, lett n denote the elapsed time between the (n 1)th and the nth event The sequence {T n,n=1, 2, } is called the sequence of interarrival times We can now determine the distribution of the T n We have the following result: Proposition B2 T n, n =1, 2, are independent identically distributed (iid) exponential random variables having mean 1/λ This means, in particular, that and P {T 1 >t} = P {S(t) =} = e λt P {T 2 >t T 1 = t } = e λt etc Furthermore, the arrival time of the nth event, also called the waiting time until the nth event and denoted by Σ n, is given by P Σ n = n T i, n 1 i=1 Σ n has a gamma distribution with parameters n and λ That is, the probability density of Σ n is: f Σn (t) =λe λt (λt)n 1 (n 1)!

6 4 B POISSON PROCESS AND DERIVATION OF BELLMAN EQUATIONS 2 An intuitive way of deriving the Bellman equations Let us first derive the expected lifetime-utility of an unemployed worker I U This analysis is valid for both search-matching (Part 1) and efficiency wage (Part 2) models During a small interval of time dt, the unemployed worker obtains W U and during this time, he/she may find a job and enjoys an expected lifetime-utility level of I E at time t + dt The probability that he/she finds a job is: adt + o(dt) with lim o(dt)/dt =Ifhe/shedoesnotfind a job, dt then he/she enjoys utility I U at time t + dt Observe that, during this small interval of time dt, the probability that the unemployed worker leaves unemployment and then straightaway loses his/her new job is negligible with respect to dt (sinceitisatermin(dt) 2 ) We have: 2 I U (t) =W U (t)dt + This is equivalent to 1 1+rdt [adt I L(t + dt)+(1 adt)i U (t + dt)] (1 + rdt) I U (t) =(1+rdt) W U (t)dt + adt I L (t + dt)+(1 adt)i U (t + dt) ri U (t)dt = W U (t)dt + rw U (t)(dt) 2 + adt [I L (t + dt) I U (t + dt)] + I U (t + dt) I U (t) Now, by dividing everything by dt, we obtain (observe that (dt) 2 is negligible compared to dt) ri U (t) =W U (t)+a[i L (t + dt) I U (t + dt)] + I U(t + dt) I U (t) dt By taking the limit when dt, weget ri U (t) =W U (t)+a [I L (t) I U (t)] + I U (t) since I U (t) di U(t) I U (t + dt) I U (t) = lim dt dt dt In steady-state, I U (t) =and I U (t) =I U and I L (t) =I L The steady-state lifetime expected utility of an unemployed worker is given by: 2 Wecouldhavediscountedinadifferent way, ri U = W U + a (I L I U ) 1 I U (t) = 1+rdt [W U (t)dt + adti E (t + dt)+(1 adt)i U (t + dt)] ie before starting the period In this case, it is easily verified that the Bellman equation would have been exactly the same

7 3 A FORMAL WAY OF DERIVING THE BELLMAN EQUATIONS 41 Let us now determine the expected lifetime-utility of a non-shirking employed worker I L We have: I L (t) =WL NS 1 (t)dt + δdt IU (t + dt)+(1 δdt)il NS (t + dt) 1+rdt By replicating the same analysis as for the unemployed, we easily obtain for employed workers: ri L = W NS L δ (I E I U ) Letusnowfocusmorespecifically on efficiency wage models (Part 2) Determining the case of shirking is more complicated since shirking workers can lose their jobs either by an exogenous shock δ or by being caught shirking at rate m Wehave IL(t) S =WL S 1 (t)dt + δdtiu (t + dt)+mdt I U (t + dt)+(1 (δ + m) dt) I S 1+rdt L(t + dt) By replicating the same analysis, we obtain: ri S L = W S L (δ + m) I S L I U (B2) 3 A formal way of deriving the Bellman equations As stated above, changes in employment status are assumed to be governed by a Poisson process with two states: employed or unemployed Consider a Poisson process (as defined by Definition B4 or Definition B5) As shown in Proposition B2, the key feature of these stochastic processes is that the duration time spent in each state is a random variable with exponential distribution More precisely, if we denote the (random) unemployment and employment duration times by T a and T δ,then F (T a )=P {T a <t} =1 e at a F (T δ )=P {T δ <t} =1 e δt δ This implies that the probability densities are given by: f(t a )=ae ata (B3) f(t δ )=δe δt δ (B4)

8 42 B POISSON PROCESS AND DERIVATION OF BELLMAN EQUATIONS As a result, the average time spent in each state is equal to (see Definition B1): E [T a ] = = = Z + Z + Z + = 1 a = 1 a T a f(t a )dt a at a e ata dt a e ata dt a T a e ata + e at a + T a e ata + since Similarly, lim T a + T a e at a = lim Ta T a e at a = E [T δ ]= Z + T δ f(t δ )dt δ = 1 δ As above, let us first determine the expected lifetime-utility of an unemployed worker, I U It is given by: Z Ta I U = E Ta W U e rt dt + e rta I L (B5) I U is thus the discounted value at time t = The unemployed worker remains unemployed during a random period of time T a During this period, he/she earns w U discounted at rate r Then, after this period T a, he/she becomes employed and obtains an expected utility of I L discounted at rate r starting at time t = T a By developing (B5), we obtain: I U = + Z Z Ta + Z W U e rt dt f(t a )dt a + e rt a I E f(t a )dt a Since Z Ta W U e rt dt = W U 1 e rt a r,

9 3 A FORMAL WAY OF DERIVING THE BELLMAN EQUATIONS 43 and using (B3), it can be rewritten as: I U = a W U r = a W U r + Z + Z 1 e rt a e at a dt a + ai L e rt a e at a dt a + Z e at a e Z (r+a)t a dt a + ai L = W U r + a + a r + a I L We finally obtain: ri U = W U + a (I L I U ) + e (r+a)t a dt a (B6) Similarly, we can calculate the expected lifetime-utility of an employed worker I L (non shirking in the efficiency wage model) It is: Z Tδ IL NS = E Tδ WL NS e rt dt + e rt δ I U (B7) By making exactly the same analysis, one easily obtains: ri NS L = W NS L δ (I L I U ) (B8) For the efficiency wage model, we need to consider the case of a shirker It is more complicated since, when employed, a shirker can lose his/her job because either he/has been caught shirking or the job has been destroyed Denote by T m the(random)lengthoftimeuntilthe next control of shirking occurs This implies that T a is still the (random) unemployment duration time whereas min(t δ,t m ) is now the employment duration time for a shirker Since we know (see, for example, Kulkarni, 1995, ch 5) that min(t δ,t m ) is a random variable characterized by an exponential distribution of parameter δ + m, ie F (min(t δ,t m )) = P [min(t δ,t m ) <t]=1 e (δ+m) min(t δ,t m) then the expected lifetime-utility of a shirker IL S is equal to: " Z # min(tδ,t m) IL S = E WL S e rt dt + e r min(t δ,t m ) I U By doing exactly the same kind of manipulations as above, we obtain (B2)

The exponential distribution and the Poisson process

The exponential distribution and the Poisson process The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]

More information

Exponential Distribution and Poisson Process

Exponential Distribution and Poisson Process Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential

More information

Chapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Chapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition

More information

Arrivals and waiting times

Arrivals and waiting times Chapter 20 Arrivals and waiting times The arrival times of events in a Poisson process will be continuous random variables. In particular, the time between two successive events, say event n 1 and event

More information

Continuous-time Markov Chains

Continuous-time Markov Chains Continuous-time Markov Chains Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ October 23, 2017

More information

Northwestern University Department of Electrical Engineering and Computer Science

Northwestern University Department of Electrical Engineering and Computer Science Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability

More information

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one

More information

Part I Stochastic variables and Markov chains

Part I Stochastic variables and Markov chains Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)

More information

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes The story of the film so far... Mathematics for Informatics 4a José Figueroa-O Farrill Lecture 19 28 March 2012 We have been studying stochastic processes; i.e., systems whose time evolution has an element

More information

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic process X = {X(t), t2 T} is a collection of random variables (rvs); one rv

More information

3. Poisson Processes (12/09/12, see Adult and Baby Ross)

3. Poisson Processes (12/09/12, see Adult and Baby Ross) 3. Poisson Processes (12/09/12, see Adult and Baby Ross) Exponential Distribution Poisson Processes Poisson and Exponential Relationship Generalizations 1 Exponential Distribution Definition: The continuous

More information

Random variables and transform methods

Random variables and transform methods Chapter Random variables and transform methods. Discrete random variables Suppose X is a random variable whose range is {,,..., } and set p k = P (X = k) for k =,,..., so that its mean and variance are

More information

Continuous time Markov chains

Continuous time Markov chains Continuous time Markov chains Alejandro Ribeiro Dept. of Electrical and Systems Engineering University of Pennsylvania aribeiro@seas.upenn.edu http://www.seas.upenn.edu/users/~aribeiro/ October 16, 2017

More information

Continuous Time Processes

Continuous Time Processes page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point

More information

Poisson Processes. Stochastic Processes. Feb UC3M

Poisson Processes. Stochastic Processes. Feb UC3M Poisson Processes Stochastic Processes UC3M Feb. 2012 Exponential random variables A random variable T has exponential distribution with rate λ > 0 if its probability density function can been written

More information

Chapter 2. Poisson Processes

Chapter 2. Poisson Processes Chapter 2. Poisson Processes Prof. Ai-Chun Pang Graduate Institute of Networking and Multimedia, epartment of Computer Science and Information Engineering, National Taiwan University, Taiwan utline Introduction

More information

Lecture 4a: Continuous-Time Markov Chain Models

Lecture 4a: Continuous-Time Markov Chain Models Lecture 4a: Continuous-Time Markov Chain Models Continuous-time Markov chains are stochastic processes whose time is continuous, t [0, ), but the random variables are discrete. Prominent examples of continuous-time

More information

errors every 1 hour unless he falls asleep, in which case he just reports the total errors

errors every 1 hour unless he falls asleep, in which case he just reports the total errors I. First Definition of a Poisson Process A. Definition: Poisson process A Poisson Process {X(t), t 0} with intensity λ > 0 is a counting process with the following properties. INDEPENDENT INCREMENTS. For

More information

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution

More information

Manual for SOA Exam MLC.

Manual for SOA Exam MLC. Chapter 10. Poisson processes. Section 10.5. Nonhomogenous Poisson processes Extract from: Arcones Fall 2009 Edition, available at http://www.actexmadriver.com/ 1/14 Nonhomogenous Poisson processes Definition

More information

RENEWAL PROCESSES AND POISSON PROCESSES

RENEWAL PROCESSES AND POISSON PROCESSES 1 RENEWAL PROCESSES AND POISSON PROCESSES Andrea Bobbio Anno Accademico 1997-1998 Renewal and Poisson Processes 2 Renewal Processes A renewal process is a point process characterized by the fact that the

More information

1 Some basic renewal theory: The Renewal Reward Theorem

1 Some basic renewal theory: The Renewal Reward Theorem Copyright c 27 by Karl Sigman Some basic renewal theory: The Renewal Reward Theorem Here, we will present some basic results in renewal theory such as the elementary renewal theorem, and then the very

More information

The Harris-Todaro model

The Harris-Todaro model Yves Zenou Research Institute of Industrial Economics July 3, 2006 The Harris-Todaro model In two seminal papers, Todaro (1969) and Harris and Todaro (1970) have developed a canonical model of rural-urban

More information

EDRP lecture 7. Poisson process. Pawe J. Szab owski

EDRP lecture 7. Poisson process. Pawe J. Szab owski EDRP lecture 7. Poisson process. Pawe J. Szab owski 2007 Counting process Random process fn t ; t 0g is called a counting process, if N t is equal total number of events that have happened up to moment

More information

Supratim Ray

Supratim Ray Supratim Ray sray@cns.iisc.ernet.in Biophysics of Action Potentials Passive Properties neuron as an electrical circuit Passive Signaling cable theory Active properties generation of action potential Techniques

More information

CS 237: Probability in Computing

CS 237: Probability in Computing CS 237: Probability in Computing Wayne Snyder Computer Science Department Boston University Lecture 13: Normal Distribution Exponential Distribution Recall that the Normal Distribution is given by an explicit

More information

Assignment 3 with Reference Solutions

Assignment 3 with Reference Solutions Assignment 3 with Reference Solutions Exercise 3.: Poisson Process Given are k independent sources s i of jobs as shown in the figure below. The interarrival time between jobs for each source is exponentially

More information

PROBABILITY DISTRIBUTIONS

PROBABILITY DISTRIBUTIONS Review of PROBABILITY DISTRIBUTIONS Hideaki Shimazaki, Ph.D. http://goo.gl/visng Poisson process 1 Probability distribution Probability that a (continuous) random variable X is in (x,x+dx). ( ) P x < X

More information

Stochastic Modelling Unit 1: Markov chain models

Stochastic Modelling Unit 1: Markov chain models Stochastic Modelling Unit 1: Markov chain models Russell Gerrard and Douglas Wright Cass Business School, City University, London June 2004 Contents of Unit 1 1 Stochastic Processes 2 Markov Chains 3 Poisson

More information

EE126: Probability and Random Processes

EE126: Probability and Random Processes EE126: Probability and Random Processes Lecture 19: Poisson Process Abhay Parekh UC Berkeley March 31, 2011 1 1 Logistics 2 Review 3 Poisson Processes 2 Logistics 3 Poisson Process A continuous version

More information

STAT 380 Markov Chains

STAT 380 Markov Chains STAT 380 Markov Chains Richard Lockhart Simon Fraser University Spring 2016 Richard Lockhart (Simon Fraser University) STAT 380 Markov Chains Spring 2016 1 / 38 1/41 PoissonProcesses.pdf (#2) Poisson Processes

More information

Poisson Processes for Neuroscientists

Poisson Processes for Neuroscientists Poisson Processes for Neuroscientists Thibaud Taillefumier This note is an introduction to the key properties of Poisson processes, which are extensively used to simulate spike trains. For being mathematical

More information

Renewal theory and its applications

Renewal theory and its applications Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially

More information

Figure 10.1: Recording when the event E occurs

Figure 10.1: Recording when the event E occurs 10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable

More information

Poisson Processes. Particles arriving over time at a particle detector. Several ways to describe most common model.

Poisson Processes. Particles arriving over time at a particle detector. Several ways to describe most common model. Poisson Processes Particles arriving over time at a particle detector. Several ways to describe most common model. Approach 1: a) numbers of particles arriving in an interval has Poisson distribution,

More information

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes? IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only

More information

1 Probability and Random Variables

1 Probability and Random Variables 1 Probability and Random Variables The models that you have seen thus far are deterministic models. For any time t, there is a unique solution X(t). On the other hand, stochastic models will result in

More information

Online Appendix to Asymmetric Information and Search Frictions: A Neutrality Result

Online Appendix to Asymmetric Information and Search Frictions: A Neutrality Result Online Appendix to Asymmetric Information and Search Frictions: A Neutrality Result Neel Rao University at Buffalo, SUNY August 26, 2016 Abstract The online appendix extends the analysis to the case where

More information

Random variables. DS GA 1002 Probability and Statistics for Data Science.

Random variables. DS GA 1002 Probability and Statistics for Data Science. Random variables DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Motivation Random variables model numerical quantities

More information

Basics of Stochastic Modeling: Part II

Basics of Stochastic Modeling: Part II Basics of Stochastic Modeling: Part II Continuous Random Variables 1 Sandip Chakraborty Department of Computer Science and Engineering, INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR August 10, 2016 1 Reference

More information

Remarks on Structural Estimation The Search Framework

Remarks on Structural Estimation The Search Framework Remarks on Structural Estimation The Search Framework Christopher Flinn NYU and Collegio Carlo Alberto November 2009 1 The Estimation of Search Models We develop a simple model of single agent search set

More information

Things to remember when learning probability distributions:

Things to remember when learning probability distributions: SPECIAL DISTRIBUTIONS Some distributions are special because they are useful They include: Poisson, exponential, Normal (Gaussian), Gamma, geometric, negative binomial, Binomial and hypergeometric distributions

More information

Lecture 20. Poisson Processes. Text: A Course in Probability by Weiss STAT 225 Introduction to Probability Models March 26, 2014

Lecture 20. Poisson Processes. Text: A Course in Probability by Weiss STAT 225 Introduction to Probability Models March 26, 2014 Lecture 20 Text: A Course in Probability by Weiss 12.1 STAT 225 Introduction to Probability Models March 26, 2014 Whitney Huang Purdue University 20.1 Agenda 1 2 20.2 For a specified event that occurs

More information

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) = Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of

More information

Continuous Probability Spaces

Continuous Probability Spaces Continuous Probability Spaces Ω is not countable. Outcomes can be any real number or part of an interval of R, e.g. heights, weights and lifetimes. Can not assign probabilities to each outcome and add

More information

M/G/1 and M/G/1/K systems

M/G/1 and M/G/1/K systems M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded

More information

STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution

STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution Pengyuan (Penelope) Wang June 15, 2011 Review Discussed Uniform Distribution and Normal Distribution Normal Approximation

More information

ELEMENTS OF PROBABILITY THEORY

ELEMENTS OF PROBABILITY THEORY ELEMENTS OF PROBABILITY THEORY Elements of Probability Theory A collection of subsets of a set Ω is called a σ algebra if it contains Ω and is closed under the operations of taking complements and countable

More information

Optimization and Simulation

Optimization and Simulation Optimization and Simulation Simulating events: the Michel Bierlaire Transport and Mobility Laboratory School of Architecture, Civil and Environmental Engineering Ecole Polytechnique Fédérale de Lausanne

More information

Lecture 3: Introduction to search theory. 1 Job search with an exogenous wage distribution

Lecture 3: Introduction to search theory. 1 Job search with an exogenous wage distribution BURNABY SIMON FRASER UNIVERSITY BRITISH COLUMBIA Paul Klein Office: WMC 3635 Phone: TBA Email: paul klein 2@sfu.ca URL: http://paulklein.ca/newsite/teaching/89.php Economics 89 Advanced macroeconomic theory

More information

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr. Simulation Discrete-Event System Simulation Chapter 4 Statistical Models in Simulation Purpose & Overview The world the model-builder sees is probabilistic rather than deterministic. Some statistical model

More information

Stochastic Renewal Processes in Structural Reliability Analysis:

Stochastic Renewal Processes in Structural Reliability Analysis: Stochastic Renewal Processes in Structural Reliability Analysis: An Overview of Models and Applications Professor and Industrial Research Chair Department of Civil and Environmental Engineering University

More information

EE126: Probability and Random Processes

EE126: Probability and Random Processes EE126: Probability and Random Processes Lecture 18: Poisson Process Abhay Parekh UC Berkeley March 17, 2011 1 1 Review 2 Poisson Process 2 Bernoulli Process An arrival process comprised of a sequence of

More information

Expected Values, Exponential and Gamma Distributions

Expected Values, Exponential and Gamma Distributions Expected Values, Exponential and Gamma Distributions Sections 5.2 & 5.4 Cathy Poliak, Ph.D. cathy@math.uh.edu Office in Fleming 11c Department of Mathematics University of Houston Lecture 13-3339 Cathy

More information

ECE 313 Probability with Engineering Applications Fall 2000

ECE 313 Probability with Engineering Applications Fall 2000 Exponential random variables Exponential random variables arise in studies of waiting times, service times, etc X is called an exponential random variable with parameter λ if its pdf is given by f(u) =

More information

2 Continuous Random Variables and their Distributions

2 Continuous Random Variables and their Distributions Name: Discussion-5 1 Introduction - Continuous random variables have a range in the form of Interval on the real number line. Union of non-overlapping intervals on real line. - We also know that for any

More information

Slides 8: Statistical Models in Simulation

Slides 8: Statistical Models in Simulation Slides 8: Statistical Models in Simulation Purpose and Overview The world the model-builder sees is probabilistic rather than deterministic: Some statistical model might well describe the variations. An

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 20, 2012 Introduction Introduction The world of the model-builder

More information

DS-GA 1002 Lecture notes 2 Fall Random variables

DS-GA 1002 Lecture notes 2 Fall Random variables DS-GA 12 Lecture notes 2 Fall 216 1 Introduction Random variables Random variables are a fundamental tool in probabilistic modeling. They allow us to model numerical quantities that are uncertain: the

More information

3 Continuous Random Variables

3 Continuous Random Variables Jinguo Lian Math437 Notes January 15, 016 3 Continuous Random Variables Remember that discrete random variables can take only a countable number of possible values. On the other hand, a continuous random

More information

Stochastic Simulation.

Stochastic Simulation. Stochastic Simulation. (and Gillespie s algorithm) Alberto Policriti Dipartimento di Matematica e Informatica Istituto di Genomica Applicata A. Policriti Stochastic Simulation 1/20 Quote of the day D.T.

More information

Markov Processes and Queues

Markov Processes and Queues MIT 2.853/2.854 Introduction to Manufacturing Systems Markov Processes and Queues Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Markov Processes

More information

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models

More information

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Queueing Theory. VK Room: M Last updated: October 17, 2013. Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server

More information

MARKOV PROCESSES. Valerio Di Valerio

MARKOV PROCESSES. Valerio Di Valerio MARKOV PROCESSES Valerio Di Valerio Stochastic Process Definition: a stochastic process is a collection of random variables {X(t)} indexed by time t T Each X(t) X is a random variable that satisfy some

More information

IEOR 6711, HMWK 5, Professor Sigman

IEOR 6711, HMWK 5, Professor Sigman IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.

More information

Homework 4 due on Thursday, December 15 at 5 PM (hard deadline).

Homework 4 due on Thursday, December 15 at 5 PM (hard deadline). Large-Time Behavior for Continuous-Time Markov Chains Friday, December 02, 2011 10:58 AM Homework 4 due on Thursday, December 15 at 5 PM (hard deadline). How are formulas for large-time behavior of discrete-time

More information

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Thursday, October 4 Renewal Theory: Renewal Reward Processes

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Thursday, October 4 Renewal Theory: Renewal Reward Processes IEOR 67: Stochastic Models I Fall 202, Professor Whitt, Thursday, October 4 Renewal Theory: Renewal Reward Processes Simple Renewal-Reward Theory Suppose that we have a sequence of i.i.d. random vectors

More information

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals Noèlia Viles Cuadros BCAM- Basque Center of Applied Mathematics with Prof. Enrico

More information

Optional Stopping Theorem Let X be a martingale and T be a stopping time such

Optional Stopping Theorem Let X be a martingale and T be a stopping time such Plan Counting, Renewal, and Point Processes 0. Finish FDR Example 1. The Basic Renewal Process 2. The Poisson Process Revisited 3. Variants and Extensions 4. Point Processes Reading: G&S: 7.1 7.3, 7.10

More information

Chapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University

Chapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real

More information

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 29, 2014 Introduction Introduction The world of the model-builder

More information

Simulating events: the Poisson process

Simulating events: the Poisson process Simulating events: te Poisson process p. 1/15 Simulating events: te Poisson process Micel Bierlaire micel.bierlaire@epfl.c Transport and Mobility Laboratory Simulating events: te Poisson process p. 2/15

More information

Stochastic process. X, a series of random variables indexed by t

Stochastic process. X, a series of random variables indexed by t Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,

More information

Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t

Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of. F s F t 2.2 Filtrations Let (Ω, F) be a measureable space. A filtration in discrete time is a sequence of σ algebras {F t } such that F t F and F t F t+1 for all t = 0, 1,.... In continuous time, the second condition

More information

Chapter 4 Continuous Random Variables and Probability Distributions

Chapter 4 Continuous Random Variables and Probability Distributions Chapter 4 Continuous Random Variables and Probability Distributions Part 3: The Exponential Distribution and the Poisson process Section 4.8 The Exponential Distribution 1 / 21 Exponential Distribution

More information

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days? IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross

More information

Chapter 6: Random Processes 1

Chapter 6: Random Processes 1 Chapter 6: Random Processes 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.

More information

1 Delayed Renewal Processes: Exploiting Laplace Transforms

1 Delayed Renewal Processes: Exploiting Laplace Transforms IEOR 6711: Stochastic Models I Professor Whitt, Tuesday, October 22, 213 Renewal Theory: Proof of Blackwell s theorem 1 Delayed Renewal Processes: Exploiting Laplace Transforms The proof of Blackwell s

More information

Random Processes. DS GA 1002 Probability and Statistics for Data Science.

Random Processes. DS GA 1002 Probability and Statistics for Data Science. Random Processes DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Modeling quantities that evolve in time (or space)

More information

Lecture 7. Poisson and lifetime processes in risk analysis

Lecture 7. Poisson and lifetime processes in risk analysis Lecture 7. Poisson and lifetime processes in risk analysis Jesper Rydén Department of Mathematics, Uppsala University jesper.ryden@math.uu.se Statistical Risk Analysis Spring 2014 Example: Life times of

More information

MITOCW MITRES6_012S18_L23-05_300k

MITOCW MITRES6_012S18_L23-05_300k MITOCW MITRES6_012S18_L23-05_300k We will now go through a beautiful example, in which we approach the same question in a number of different ways and see that by reasoning based on the intuitive properties

More information

An adaptation of Pissarides (1990) by using random job destruction rate

An adaptation of Pissarides (1990) by using random job destruction rate MPRA Munich Personal RePEc Archive An adaptation of Pissarides (990) by using random job destruction rate Huiming Wang December 2009 Online at http://mpra.ub.uni-muenchen.de/203/ MPRA Paper No. 203, posted

More information

Common ontinuous random variables

Common ontinuous random variables Common ontinuous random variables CE 311S Earlier, we saw a number of distribution families Binomial Negative binomial Hypergeometric Poisson These were useful because they represented common situations:

More information

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100] HW7 Solutions. 5 pts.) James Bond James Bond, my favorite hero, has again jumped off a plane. The plane is traveling from from base A to base B, distance km apart. Now suppose the plane takes off from

More information

Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays

Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays Kar Wai Lim, Young Lee, Leif Hanlen, Hongbiao Zhao Australian National University Data61/CSIRO

More information

Tyler Hofmeister. University of Calgary Mathematical and Computational Finance Laboratory

Tyler Hofmeister. University of Calgary Mathematical and Computational Finance Laboratory JUMP PROCESSES GENERALIZING STOCHASTIC INTEGRALS WITH JUMPS Tyler Hofmeister University of Calgary Mathematical and Computational Finance Laboratory Overview 1. General Method 2. Poisson Processes 3. Diffusion

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6

MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and

More information

EE 445 / 850: Final Examination

EE 445 / 850: Final Examination EE 445 / 850: Final Examination Date and Time: 3 Dec 0, PM Room: HLTH B6 Exam Duration: 3 hours One formula sheet permitted. - Covers chapters - 5 problems each carrying 0 marks - Must show all calculations

More information

Poisson processes and their properties

Poisson processes and their properties Poisson processes and their properties Poisson processes. collection {N(t) : t [, )} of rando variable indexed by tie t is called a continuous-tie stochastic process, Furtherore, we call N(t) a Poisson

More information

(a) Write down the Hamilton-Jacobi-Bellman (HJB) Equation in the dynamic programming

(a) Write down the Hamilton-Jacobi-Bellman (HJB) Equation in the dynamic programming 1. Government Purchases and Endogenous Growth Consider the following endogenous growth model with government purchases (G) in continuous time. Government purchases enhance production, and the production

More information

(Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3)

(Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3) 3 Probability Distributions (Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3) Probability Distribution Functions Probability distribution function (pdf): Function for mapping random variables to real numbers. Discrete

More information

Exponential & Gamma Distributions

Exponential & Gamma Distributions Exponential & Gamma Distributions Engineering Statistics Section 4.4 Josh Engwer TTU 7 March 26 Josh Engwer (TTU) Exponential & Gamma Distributions 7 March 26 / 2 PART I PART I: EXPONENTIAL DISTRIBUTION

More information

Data analysis and stochastic modeling

Data analysis and stochastic modeling Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt

More information

Lecture 20: Reversible Processes and Queues

Lecture 20: Reversible Processes and Queues Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n

More information

Gaussian, Markov and stationary processes

Gaussian, Markov and stationary processes Gaussian, Markov and stationary processes Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ November

More information

Modelling in Systems Biology

Modelling in Systems Biology Modelling in Systems Biology Maria Grazia Vigliotti thanks to my students Anton Stefanek, Ahmed Guecioueur Imperial College Formal representation of chemical reactions precise qualitative and quantitative

More information

6.041/6.431 Fall 2010 Final Exam Solutions Wednesday, December 15, 9:00AM - 12:00noon.

6.041/6.431 Fall 2010 Final Exam Solutions Wednesday, December 15, 9:00AM - 12:00noon. 604/643 Fall 200 Final Exam Solutions Wednesday, December 5, 9:00AM - 2:00noon Problem (32 points) Consider a Markov chain {X n ; n 0,, }, specified by the following transition diagram 06 05 09 04 03 2

More information

CHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES

CHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES 27 CHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES 3.1 INTRODUCTION The express purpose of this research is to assimilate reliability and its associated probabilistic variables into the Unit

More information

1 Poisson processes, and Compound (batch) Poisson processes

1 Poisson processes, and Compound (batch) Poisson processes Copyright c 2007 by Karl Sigman 1 Poisson processes, and Compound (batch) Poisson processes 1.1 Point Processes Definition 1.1 A simple point process ψ = {t n : n 1} is a sequence of strictly increasing

More information