Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time

Similar documents
Readings: Finish Section 5.2

Markov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

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

IEOR 6711, HMWK 5, Professor Sigman

Chapter 3 Balance equations, birth-death processes, continuous Markov Chains

The Transition Probability Function P ij (t)

TCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Markov Processes Cont d. Kolmogorov Differential Equations

88 CONTINUOUS MARKOV CHAINS

LECTURE #6 BIRTH-DEATH PROCESS

Interlude: Practice Final

Data analysis and stochastic modeling

Statistics 150: Spring 2007

Networking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013

Question Points Score Total: 70

Lecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking

reversed chain is ergodic and has the same equilibrium probabilities (check that π j =

Introduction to Queuing Networks Solutions to Problem Sheet 3

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012

L = λ W time average number in Line or system arrival rate W average Waiting time per customer

Introduction to queuing theory

Time Reversibility and Burke s Theorem

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

Homework set 4 - Solutions

CS 798: Homework Assignment 3 (Queueing Theory)

Lecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes

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

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

Continuous-Time Markov Chain

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Continuous Time Processes

Stochastic Processes

Computer Systems Modelling

57:022 Principles of Design II Final Exam Solutions - Spring 1997

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

STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008

Be sure this exam has 9 pages including the cover. The University of British Columbia

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

Lecture 20: Reversible Processes and Queues

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

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

Examination paper for TMA4265 Stochastic Processes

Irreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1

Continuous Time Markov Chains

Availability. M(t) = 1 - e -mt

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

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) GRADUATE DIPLOMA, 2004

PBW 654 Applied Statistics - I Urban Operations Research

IE 336 Seat # Name (one point) < KEY > Closed book. Two pages of hand-written notes, front and back. No calculator. 60 minutes.

Markov chains. 1 Discrete time Markov chains. c A. J. Ganesh, University of Bristol, 2015

Stochastic Processes MIT, fall 2011 Day by day lecture outline and weekly homeworks. A) Lecture Outline Suggested reading

Session-Based Queueing Systems

MATH37012 Week 10. Dr Jonathan Bagley. Semester

Markov processes and queueing networks

TMA4265 Stochastic processes ST2101 Stochastic simulation and modelling

Performance Modelling of Computer Systems

stochnotes Page 1

EXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013 Time: 9:00 13:00

Continuous time Markov chains

A&S 320: Mathematical Modeling in Biology

Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

Performance Evaluation of Queuing Systems

Introduction to Markov Chains, Queuing Theory, and Network Performance

Quantitative Model Checking (QMC) - SS12

Sandwich shop : a queuing net work with finite disposable resources queue and infinite resources queue

Stochastic Modelling Unit 1: Markov chain models

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?

Note that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < +

56:171 Operations Research Final Examination December 15, 1998

LIMITS FOR QUEUES AS THE WAITING ROOM GROWS. Bell Communications Research AT&T Bell Laboratories Red Bank, NJ Murray Hill, NJ 07974

ECE-517: Reinforcement Learning in Artificial Intelligence. Lecture 4: Discrete-Time Markov Chains

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

56:171 Operations Research Fall 1998

Problem Set 8

MAS1302 Computational Probability and Statistics

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

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014

MATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015

6.231 DYNAMIC PROGRAMMING LECTURE 13 LECTURE OUTLINE

Part I Stochastic variables and Markov chains

Problems. HW problem 5.7 Math 504. Spring CSUF by Nasser Abbasi

Lecture Notes of Communication Network I y: part 5. Lijun Qian. Rutgers The State University of New Jersey. 94 Brett Road. Piscataway, NJ

Systems Simulation Chapter 6: Queuing Models

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

Math 597/697: Solution 5

1 IEOR 4701: Continuous-Time Markov Chains

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Queuing Theory. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011

Renewal theory and its applications

Hitting Probabilities

Lecture 21. David Aldous. 16 October David Aldous Lecture 21

Random Walk on a Graph

Lecture 4a: Continuous-Time Markov Chain Models

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

SMSTC (2007/08) Probability.

Chapter 16 focused on decision making in the face of uncertainty about one future

Transcription:

Math 416 Lecture 11 Math 416 Lecture 16 Exam 2 next time Birth and death processes, queueing theory In arrival processes, the state only jumps up. In a birth-death process, it can either jump up or down by one unit. A birth-death process counts the number of objects j=n t in a queue to which items can be added or deleted. The state is the size j of the population. In arrival processes, the arrival rate λ is constant and does not depend on the state j. In birth-death processes, both birth rates λ j and death rates µ j may depend on the state j. When the population is 0, the death rate µ 0 =??

If there is an upper bound M on the population size, the state space of population sizes is {0, 1, 2,..., M}. When the population size is maximum, the birth rate λ M =??

Examples of queues. v The customer queue in front of a checkout counter. A birth occurs when a customer joins the line. A death occurs when the customer has been served or when a customer leaves the line for another checkout lane. v The resident population of Hawaii is a queue. A birth occurs when a new resident arrives or is born. A death occurs when a resident dies or leaves Hawaii. v The world-wide population of monk seals. Births and deaths are the only way the population changes. In this case, when the population j = 0 not only is the death rate µ j = 0, but also the birth rate λ j = 0 (extinction has occurred). v The number of occupied tables in a restaurant. This queue has an upper bound, the number M of tables. When all tables are occupied tables, j = M, and λ j = 0 since no more births (occupied tables) are possible. What happens when two births occur at the same time? How does this affect the calculation of probabilities?

In Poisson processes the time between arrivals is exponentially distributed with some arrival rate λ. The obvious analog for birth-death processes would be to measure the time between changes either births or deaths. However, the birth rates and death rates may differ. In a steady-state system, how are birth and death rates related? When the population is 0, the death rate must be 0 but the birth rate could be nonzero. If the birth rate exceeds the death rate, what happens? The birth λ j and death rates µ j may depend on the size j of the population. The birth rate is often proportional to the population size j.

DEFINITION. A birth-death process is a continuous-time counting process N t with birth rates λ j and a death rates µ j which depend on the current state j = N t. tι[0, 5)= timeset N t ι the state space of possible counts = {0, 1, 2, 3,... } or {0, 1, 2, 3,..., M} if there is an upper bound M. Unless specified otherwise, assume N 0 = 0. Let T n be the sequence of state-change times. T 0 = 0, T 1 = the time of the first birth/death, T 2 = the time of the second state change,.... What is the rate of these state changes? Let X n be the sequence of states X n = N Tn at the state-change times T n (a birth or a death). X 0 = 0, X 1 = the state (population size) immediately after the time of the first birth/death, X 2 = the population size at the time of the second state change,....

Since N Tn = X n, N t = X n when tc[t n, T n+1 ). The times T n+1 T n between state changes are exponentially distributed with a combined rate of λ j + µ j where j = X n is the state at time T n. Given a time t and the current state j = N t, the time T n+1 and the type (birth or death) of the next state change depends only on the current state j. It is independent of the time t and independent of the previous history of times (T 1, T 2,..., T n 1 ) and states (X 1, X 2,..., X n 1 ). Suppose again that the birth rate is λ j and the death rate is µ j where the state j = N t. The combined rate of transitions (births plus deaths) is λ j + µ j. For each transition with state X n and time T n, What is the probability that the next transition is a birth? P[X n+1 = j + 1 X n = j] =?? What proportion of the state changes are deaths? P[X n+1 = j 1 X n = j] =??

Let B n be the sequence of birth times. B 0 = 0, B 1 = the time of the first birth,.... The times between births are exponentially distributed with a birth rate of λ j. Let D n be the sequence of death times. The times between deaths are exponential with a death rate of µ j. A hospital has M beds. When beds are available, patients are admitted at a rate λ. Each individual patient dies or is released at a rate of µ. If there are j beds occupied, what are λ j and µ j? If j = M, λ j =?? If j < M, then λ j =?? If j = 0, µ j =?? If j >0, then µ j =?? The more occupied beds there are, the higher the rate of deaths/releases. Hence we expect µ j to be proportional to j rather than constant. If there are j beds occupied and each occupant is released/dies at a rate of µ, then the total death/release rate is j = j.

DEFINITION. Let p ij (t) = P[N t = j N 0 = i]. Let p j = lim td p jj (t). As was the case for π j and regular Markov chains, under general regularity conditions, the limit p j = lim td p ij (t) exists and is independent of the starting state j. p j is the eventual proportion of time spent in state j. In a care-home, 1/8 of the patients die in a period of t years. The number patient arrivals N t is Poisson with rate λ. Find the number D 2t of patients who will die in a period of 2t years. 1 The obvious answer is 8 (2t). What if we interpret 1/8 of the patients die in a period of t years as an expected value: E[D t N t = n] = 1 8 n? E[D 2t ] E[D 2t N 2t = n]p[n 2t = n] = n=0 1 = n=0 = 1 8 n=0 8 np[n 2t = n] = np[n 2t = n] = 1 8 E[N 2t] = 1 8 (2t)

Kolmogorov Equations From Lecture 16: DEFINITION. Let p ij (t) = P[N t = j N 0 = i]. Let p j = lim td p jj (t). As was the case for π j, under rather general regularity conditions, the limit exists and is independent of the initial state i. p j = lim td p ij (t) = eventual proportion of time spent in state j. For this lecture and the homework, assume the needed regularity conditions hold. We calculate these long-term probabilities the same way we did π j. But now the time variable is continuous. Instead of a system of equations which calculate possible next steps, we have a differential equations which calculate the rates of change. We estimate change using a small step of size h where h is sufficiently small that the probability of two or more birth/death events during time h is small enough that such double events may be ignored in estimating population changes during time intervals of size h. For differentiable functions and small h:

f (t + h) f(t)lf (t)h The amount of change is proportional to the rate of change and to the length of the time period. For a birth/death process the rates of change f (x) are the birthrates λ j and the death rates µ j where j is the population size. For a time period of length h, write the following in terms of λ j, µ j and h. The amount of change due to births.?? The change due to deaths.?? p j (t) = the probability of being in state j at time t. = the probability the population has size j at time t. p j (t + h) p j (t) = the change in the probability of being in state j during the time interval [t, t + h]. What are the two ways a population can cease to be of size j? What are the two ways a population can get to be of size j?

For a birth/death process the rates of change f (x) are the birthrates λ j and death rates µ j where j is the population size. Thus over a time period of length h the amount of change due to births is j h and the change due to deaths is j h. p j (t) = the probability of being in state j at time t. = the probability the population has size j at time t. p j (t + h) p j (t) = the change in the probability of being in state j during the time interval [t, t + h]. The two ways a population can cease to be of size j: via a birth or death. The two ways a population can get to be of size j: via a birth to a population of size j 1 or via a death in a population of size j+1. Thus j 1 j j-1 j j+1 j j+1

j 1 j j j+1 p j (t + h) p j (t)lp j (t)h =?? p j (t+h) p j (t) h =?? Taking the limit as h goes to 0 gives p j (t) =?? When j = 0, µ j = 0, there is no smaller population. Thus the equation becomes p 0 (t) = Under rather general regularity conditions, in the limit, as td, the population probability distribution approaches a stable distribution p j. In a stable distribution the population remains unchanged. Hence p j (t) = 0. Thus p j (t) is a constant. p j j-1 j j+1

j 1 j j j+1 p j (t + h) p j (t)lp j (t)h = p j (t) j h p j (t) j h + p j 1 (t) j 1 h + p j+1 (t) j+1 h = h( p j (t) j p j (t) j + p j 1 (t) j 1 + p j+1 (t) j+1 ) p j (t+h) p j (t) h = p j (t) j p j (t) j + p j 1 (t) j 1 + p j+1 (t) j+1 Taking the limit as h goes to 0 gives p j (t) = p j (t) j p j (t) j + p j 1 (t) j 1 + p j+1 (t) j+1 When j = 0, µ j = 0 and there is no smaller population. Thus the equation becomes p 0 (t) = p 0 (t) 0 + p 1 (t) 1 Under rather general regularity conditions, in the limit, as td, the population probability distribution approaches a stable distribution p j. In a stable distribution the population remains unchanged. Hence p j (t) = 0. Thus p j (t) is a constant. p j j-1 j j+1

Hence p j (t) = 0. And p j (t) is a constant p j. Thus the equations p j (t) = p j (t) j p j (t) j + p j 1 (t) j 1 + p j+1 (t) j+1 p 0 (t) = p 0 (t) 0 + p 1 (t) 1 become??

Hence p j (t) = 0. Thus p j (t) is a constant p j. Thus the equations p j (t) = p j (t) j p j (t) j + p j 1 (t) j 1 + p j+1 (t) j+1 p 0 (t) = p 0 (t) 0 + p 1 (t) 1 become 0 = p 0 0 + p 1 1,..., 0 = p j j p j j + p j 1 j 1 + p j+1 j+1,... These equations for the long-term the probabilities p 0, p 1, p 2,... of the population having sizes j= 0, 1, 2,... are the Kolmogorov steady state equations: Thus p 1 is proportional to p 0. p 2 is proportional to p 1, p 0 and hence to just p 0, p j+1 is proportional to p 0. Hence all are proportional to p 0 and hence all are proportional to each other. In particular p j is proportional to p j 1. Is p j directly or inversely proportional to j 1? Is p j directly or inversely proportional to j? Write p j in terms of p j 1, j 1 and j.

Kolmogorov steady state equations (a) 0 = p 0 0 + p 1 1 (b) 0 = p j j p j j + p j 1 j 1 + p j+1 j+1 Solve (a) for p 1 Solve (b) for p 2. Write p 2 in terms of p 0 Write p 2 in terms of p 1 Write Write p 3 in terms of p 0 p 3 in terms of p 2 Since all probabilities must total to 1, p 0 + p 1 + p 2 +... = 1 Solve for p 0.