STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008

Similar documents
A review of Continuous Time MC STA 624, Spring 2015

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

The Transition Probability Function P ij (t)

Statistics 150: Spring 2007

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

Stochastic Processes

Stochastic Processes

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

STAT STOCHASTIC PROCESSES. Contents

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

STAT 380 Continuous Time Markov Chains

Quantitative Model Checking (QMC) - SS12

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

TMA4265 Stochastic processes ST2101 Stochastic simulation and modelling

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

Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet

T. Liggett Mathematics 171 Final Exam June 8, 2011

Continuous-Time Markov Chain

Examples of Countable State Markov Chains Thursday, October 16, :12 PM

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Friday, Feb 8, 2013

88 CONTINUOUS MARKOV CHAINS

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

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

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

CS 798: Homework Assignment 3 (Queueing Theory)

Countable state discrete time Markov Chains

IEOR 6711, HMWK 5, Professor Sigman

8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains

Continuous time Markov chains

Birth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes

Markov Processes Cont d. Kolmogorov Differential Equations

Stochastic Processes. Theory for Applications. Robert G. Gallager CAMBRIDGE UNIVERSITY PRESS

(implicitly assuming time-homogeneity from here on)

Markov processes and queueing networks

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

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

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

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

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

1 Continuous-time chains, finite state space

STOCHASTIC PROCESSES Basic notions

DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition

Probability, Random Processes and Inference

Homework 3 posted, due Tuesday, November 29.

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

Lecture 4a: Continuous-Time Markov Chain Models

At the boundary states, we take the same rules except we forbid leaving the state space, so,.

Introduction to Queuing Networks Solutions to Problem Sheet 3

LECTURE #6 BIRTH-DEATH PROCESS

Markov Chain Model for ALOHA protocol

SMSTC (2007/08) Probability.

Example: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected

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

Adventures in Stochastic Processes

Readings: Finish Section 5.2

Chapter 7. Markov chain background. 7.1 Finite state space

Data analysis and stochastic modeling

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is

Non-homogeneous random walks on a semi-infinite strip

1 IEOR 4701: Continuous-Time Markov Chains

Advanced Computer Networks Lecture 2. Markov Processes

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

= P{X 0. = i} (1) If the MC has stationary transition probabilities then, = i} = P{X n+1

Performance Evaluation of Queuing Systems

MARKOV PROCESSES. Valerio Di Valerio

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

Lecture 20: Reversible Processes and Queues

Time Reversibility and Burke s Theorem

ISM206 Lecture, May 12, 2005 Markov Chain

M.Sc. (MATHEMATICS WITH APPLICATIONS IN COMPUTER SCIENCE) M.Sc. (MACS)

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

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321

Birth-death chain models (countable state)

Markov chains. Randomness and Computation. Markov chains. Markov processes

Markov Chains, Stochastic Processes, and Matrix Decompositions

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

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?

LTCC. Exercises. (1) Two possible weather conditions on any day: {rainy, sunny} (2) Tomorrow s weather depends only on today s weather

IEOR 3106: Second Midterm Exam, Chapters 5-6, November 7, 2013

MATH37012 Week 10. Dr Jonathan Bagley. Semester

AARMS Homework Exercises

Applied Stochastic Processes

Stability and Rare Events in Stochastic Models Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk

A REVIEW AND APPLICATION OF HIDDEN MARKOV MODELS AND DOUBLE CHAIN MARKOV MODELS

Classification of Countable State Markov Chains

Part I Stochastic variables and Markov chains

Markov Chains (Part 3)

APPM 4/5560 Markov Processes Fall 2019, Some Review Problems for Exam One

LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE

Random Walk on a Graph

Probability Distributions

2 Discrete-Time Markov Chains

Contents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory

An Introduction to Stochastic Modeling

Winter 2019 Math 106 Topics in Applied Mathematics. Lecture 9: Markov Chain Monte Carlo

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

Series Expansions in Queues with Server

MSc MT15. Further Statistical Methods: MCMC. Lecture 5-6: Markov chains; Metropolis Hastings MCMC. Notes and Practicals available at

Transcription:

Name STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008 There are five questions on this test. DO use calculators if you need them. And then a miracle occurs is not a valid answer. There will be no bathroom break allowed. Please keep all prayers silent. You have 50 minutes to complete this test. Please ask me questions if a question needs clarification. Each question is worth the same number of points.

Question 1: Definitions (a) What does it mean for a discrete time Markov chain to be the embedded (underlying) chain for a continuous-time Markov chain {X t }? (b) What is the Markov property for a continuous time Markov chain? (c) What is to be time homogeous for a continuous time Markov chain? (d) What is a Poisson process? (e) What does it mean for a state x to be recurrent? (f) What is to be irreducible for a continuous time Markov chain? (g) What is a birth and death process? (h) What is a time-reversible continuous time Markov chain?

Question 2: True or False Mark whether each of the following states is true (T) or false (F). State a reason for each question. (a) M/M/ queue is always recurrent. (b) A Yule process is positive recurrent. (c) A poisson process is positive recurrent. (d) Let {X t, t 0} be Poisson processes with parameter λ. Define Z 1 = 2X t. Z 1 is a Poisson process. (f) Let {X t, t 0} be Poisson processes with parameter λ. Define Z 2 = X t + k where k > 0. Z 2 is a Poisson process. (g) Let {X t, t 0} and {Y t, t 0} be independent Poisson processes with parameter λ and β. Define {Z t, t 0} such that Z t = X t + Y t. {Z t, t 0} is a Poisson process. (h) Let {X t, t 0} be a Poisson process with parameter λ. Define {Z t, t 0} such that Z t = k X t where k > 1 is a constant. {Z t, t 0} is a Poisson process. (i) Let {X t, t 0} be a Poisson process with parameter λ. Define {Z t, t 0} such that Z t = X t + k where k > 0 is a constant. {Z t, t 0} is a Poisson process. (j) Let {X t, t 0} and {Y t, t 0} be independent Poisson processes with parameter λ and β. Define {Z t, t 0} such that Z t = X t Y t. {Z t, t 0} is a Poisson process. (k) Let {X t, t 0} be a Poisson process with parameter λ. Define {Z t, t 0} such that Z t = X k t, where k > 0 is a constant. {Z t, t 0} is a Poisson process. (l) Let {X t, t 0} be a Poisson process with parameter λ. Define {Z t, t 0} such that Z t = X t 2. {Z t, t 0} is a Poisson process.

Question 3: Theorems (a) State the Ergodic Theorem for countable state space continuous time Markov chains. (b) State Chapman-Komogorov equations. (c) State Chapman-Komogorov forward equations. (d) State Chapman-Komogorov backward equation. (e) State the detailed balance equations. (f) State the global balance equations.

Questions 4: Examples (Note: you do not have to prove that your example meets the required criteria, you just have to present it.) (a) Give an example of a transient birth-death chain (b) Give an example of a positive recurrent birth-death chain (c) Give an example of a positive recurrent M/M/5 queue. (d) Give an example of a M/M/1 queue such that the expected value of the length of queue is 1/2.

(e) Give an example of a continuous time Markov chain with the underlying discrete time Markov chain with S = {1,2,3,4} and the transition probability 0 0.2 0.3 0.5 D = 0.3 0 0.1 0.6 0 0.5 0 0.5 0.4 0.1 0.5 0 (f) Give an example of a continuous time Markov chain with the underlying discrete time Markov chain with S = N {0} and the transition probability p(x,x+1) = 1/2, p(x,x 1) = 1/2, for x 1 and p(0,1) = 1.

Question 5: Calculations (1) Let B i be iid random variables such that { 1 with probability p B i = 1 with probability 1 p, where 0 < p < 1. Let N(t) be a Poisson process independent of B i with constant rate λ. Define { N(t) X t = i=1 B i if N(t) i=1 B i 0 0 else. (a) Is {X t, t 0} a continuous time Markov chain? If so describe it specifically. (b) Under what conditions does it become positive recurrent? (c) Under the condition (b), calculate the stationary distribution.

(2) (a) Consider N independent Poison processes, where the rate of the ith Poison process is λ i for 1 i N. What is the probability that the first arrival from any process belongs to the jth process? (b) Let {X t, t 0} be independent Poisson processes with its rate λ and let {T k : k 0} be the kth arrival time. Compute E[T k ]. (c) A birth dead process has the birth rate λ n = 1/ n + 1 and death rate µ n = 1/ n. Is this transient? Positive recurrent? Or null recurrent?

(2) Consider a Poisson process {X t,t 0} with a parameter λ. (a) Write down the rate matrix Q for the process. (b) Let P i,j (t) be the transition probability from a state i to state j. Write down Kolmogorov s forward and backward equations for this process, {X t,t 0}. (c) What is the probability that k events occur in a time interval (s,s + t] where s,t > 0 for the Poisson process, {X t,t 0}.