Applied Stochastic Processes

Similar documents
6. Stochastic processes (2)

6. Stochastic processes (2)

Continuous Time Markov Chains

CS-433: Simulation and Modeling Modeling and Probability Review

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal

Introduction to Continuous-Time Markov Chains and Queueing Theory

Continuous Time Markov Chain

Probability and Random Variable Primer

Problem Set 9 - Solutions Due: April 27, 2005

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

Suggested solutions for the exam in SF2863 Systems Engineering. June 12,

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

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

CS 798: Homework Assignment 2 (Probability)

Analysis of Discrete Time Queues (Section 4.6)

The Feynman path integral

ECE 534: Elements of Information Theory. Solutions to Midterm Exam (Spring 2006)

Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology

Complex Numbers Alpha, Round 1 Test #123

As is less than , there is insufficient evidence to reject H 0 at the 5% level. The data may be modelled by Po(2).

Queueing Networks II Network Performance

Expected Value and Variance

Equilibrium Analysis of the M/G/1 Queue

Lecture 21: Numerical methods for pricing American type derivatives

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Math1110 (Spring 2009) Prelim 3 - Solutions

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

Distributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1

Randomness and Computation

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

Convergence of random processes

DS-GA 1002 Lecture notes 5 Fall Random processes

MATH 281A: Homework #6

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

APPENDIX A Some Linear Algebra

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Goodness of fit and Wilks theorem

Departure Process from a M/M/m/ Queue

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13]

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Chapter 7 Channel Capacity and Coding

PES 1120 Spring 2014, Spendier Lecture 6/Page 1

MAE140 - Linear Circuits - Fall 13 Midterm, October 31

8 Derivation of Network Rate Equations from Single- Cell Conductance Equations

Chapter 2 Transformations and Expectations. , and define f

Lecture 4 Hypothesis Testing

Chapter 7 Channel Capacity and Coding

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

Lecture 3: Probability Distributions

1 Matrix representations of canonical matrices

Stat 543 Exam 2 Spring 2016

PhysicsAndMathsTutor.com

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:

8 Derivation of Network Rate Equations from Single- Cell Conductance Equations

Google PageRank with Stochastic Matrix

b ), which stands for uniform distribution on the interval a x< b. = 0 elsewhere

THE ARIMOTO-BLAHUT ALGORITHM FOR COMPUTATION OF CHANNEL CAPACITY. William A. Pearlman. References: S. Arimoto - IEEE Trans. Inform. Thy., Jan.

Probability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!

THE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

% & 5.3 PRACTICAL APPLICATIONS. Given system, (49) , determine the Boolean Function, , in such a way that we always have expression: " Y1 = Y2

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Lecture 12: Discrete Laplacian

k t+1 + c t A t k t, t=0

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Lossy Compression. Compromise accuracy of reconstruction for increased compression.

Meenu Gupta, Man Singh & Deepak Gupta

Network of Markovian Queues. Lecture

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

First Year Examination Department of Statistics, University of Florida

Credit Card Pricing and Impact of Adverse Selection

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Time-Varying Systems and Computations Lecture 6

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

Outline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique

Application of Queuing Theory to Waiting Time of Out-Patients in Hospitals.

Supporting Materials for: Two Monetary Models with Alternating Markets

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

14 The Postulates of Quantum mechanics

Topics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions

Hidden Markov Models

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j

Exercises of Chapter 2

xp(x µ) = 0 p(x = 0 µ) + 1 p(x = 1 µ) = µ

Foundations of Arithmetic

8.592J: Solutions for Assignment 7 Spring 2005

= z 20 z n. (k 20) + 4 z k = 4

Homework Assignment 3 Due in class, Thursday October 15

ANSWERS CHAPTER 9. TIO 9.2: If the values are the same, the difference is 0, therefore the null hypothesis cannot be rejected.

Transcription:

STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of the rolls 2,..., y 1 should be dfferent from the prevous roll, whch occurs wth probablty (5/) y 2, and then the yth roll should be the same as the prevous roll, whch occurs wth probablty 1/. If we let N denote the net proft for the game, then E[N ] kp (Y k) + (y k)p (Y y) k + k + yk+1 yk+1 yk+1 yp (Y y) y ( ) ( ) y 2 1 5 k + (k + y) y1 k + (k + ). ( 1 ) ( ) y 1 5 (b) (8 marks) We now compute the expected net proft for the modfed game. Let N mod denote ths net proft. Then, condtonng on Y we get E[N mod ] E[N mod Y y]p (Y y) y2 k E[N mod Y y]p (Y y) + y2 yk+1 (y k)p (Y y) k E[N mod Y y]p (Y y) + E[N ] + kp (Y k) y2 (from part(a))

STAT 455/855 -- Fnal Exam Solutons, 23 Page 2 of Thus, E[N mod ] < E[N ] k E[N mod Y y]p (Y y) + kp (Y k) <. y2 We now consder E[N mod Y y] for y k. Snce we lose k dollars n the orgnal game and we pay an addtonal 1 dollar to play the second game, our expected net proft wll be the expected amount we wn n the second play of the game less ths amount. Lettng Z denote the number of rolls t takes to get two consecutve rolls that are the same, we have E[N mod Y y] (k + 1) + (k + 1) + zk+1 zp (Z z) (k + ), where the second equalty follows from part(a) snce Z and Y have the same dstrbuton. Note that E[N mod Y y] does not depend on y, so we can cancel out P (Y k) to get E[N mod ] < E[N ] (k + 1) + (k + ) + k < (k + ) < 1 < 1 k +. (Note there s an error n the hnt). One can then check on a calculator that the left hand sde s less than the rght hand sde for k 19. 2. (15 marks) Note that ths problem s very smlar to problem 7 n Chapter 4 of the text. (a) (3 marks) The transton probabltes are p,+1 M M for,..., M 1 p, 1 M for 1,..., M p j otherwse.

STAT 455/855 -- Fnal Exam Solutons, 23 Page 3 of (b) (3 marks) Intutvely, n the lmt each ball should be equally lkely to be n ether urn, ndependently of every other ball. So the number of balls n urn 1 should be expected to be dstrbuted accordng to the Bnomal dstrbuton wth parameters M and p 1/2. (c) (7 marks) We consder the local balance equatons: These gve M π M π + 1 +1 M for,..., M 1 π +1 M + 1 π. for 1,..., M. Therefore, [ M π (M )(M + 1) π 1 ( + 1) (M )(M + 1)... (M) ( + 1)()... (1) M! ( + 1)!(M ( + 1))! π ( ) M π, + 1 ( ) M ] 1 (2 M ) 1 π ( ) M 1, 2 usng the fact that 2 M (1 + 1) M M ( ) M 1 1 M M ( ) M, whch follows from the bnomal theorem. Thus, we have π ( M ) ( ) M 1, 2 for,..., M. In other words, the statonary dstrbuton s Bnomally dstrbuted wth parameters M and p 1/2, as expected. (d) (2 marks) The Markov chan {X n : n } s tme-reversble snce ts statonary dstrbuton satsfes the local balance equatons, as shown n part(c).

STAT 455/855 -- Fnal Exam Solutons, 23 Page 4 of 3. (15 marks) Let N(t) denote the number of bugs found up to tme t, so {N(t) : t } s a Posson process wth rate λ 2. Here, one unt of tme s one week. (a) (3 marks) We want E[N(5) N(3) 2]. We can wrte N(5) N(5) N(3)+N(3), where N(5) N(3) s ndependent of N(3) and s dstrbuted as Posson(4). So E[N(5) N(3) 2] 2 + E[N(5) N(3)] 2 + 4. (b) (3 marks) We want E[S 4 N(3) 2], where S4 s the tme the 4th bug s found. Gven N(3) 2 the tme untl the 4th bug s found s the tme untl the second bug after tme 3 s found. By memoryless, ths s 3 plus the sum of two ndependent Exponental(2) random varables. Thus, E[S 4 N(3) 2] 3 + 1 2 + 1 2 4. (c) (4 marks) Gven N(3) 2, these two event tmes are ndependent and unformly dstrbuted on the nterval (,3). Thus, for each event, the probablty that t was a catastrophc bug can be obtaned by condtonng on the tme of the event: P (catastrophc bug) 1 3 3 3 P (catastrophc bug 1 tme of event was s) 3 ds e s ds 1 3 (1 e 3 ). Therefore, the probablty that t was not a catastrophc event s 1 1 3 (1 e 3 ), and the probablty that nether event was a catastrophc bug s P (nether bug catastrophc N(3) 2) (1 1 3 (1 e 3 )) 2.47. (d) (5 marks) Let N 1 (t) be the number of catastrophc bugs found by tme t. Then N 1 (t) s Posson dstrbuted wth mean Therefore, E[N 1 (t)] 2 t e s ds 2(1 e t ). P (N 1 (t) > ) 1 P (N 1 (t) ) 1 exp{ 2(1 e t )}. Lettng t we obtan P (catastrophc bug s ever found) lm t P (N 1 (t) > )1 e 2.85.

STAT 455/855 -- Fnal Exam Solutons, 23 Page 5 of 4. (15 marks) (a) (11 marks) There was an error of omsson n the descrpton of the process, whch s that servce tmes are Exponentally dstrbuted wth rate µ. () (8 marks) The state space s S {(, ), (, 1), (1, ), (1, 1)}. The nfntesmal generator s gven by (θ + λ) θ λ λ λ G θ θ µ µ, where the rows of G correspond to the states (,), (,1), (1,), and (1,1), respectvely. The global balance equatons are gven by (θ + λ)π (,) µπ (1,1) λπ (,1) θπ (,) θπ (1,) λπ (,) µπ (1,1) λπ (,1) + θπ (1,) The frst three of these equatons express π (,1), π (1,), and π (1,1) n terms of π (,). Usng these, we get from the normalzaton constrant that π (,) π (,1) π (1,) π (,1) 1 1 + θ + λ + θ+λ λ θ µ θ 2 µ λ 2 µ λθ 2 + λ 2 θ λθµ () (3 marks) As θ we have lm θ π (,) lm θ π (1,), whch makes sense because the server wll never go on vacaton n the lmt, and lm π (,1) θ lm π (1,1) θ µ µ + λ λ µ + λ.

STAT 455/855 -- Fnal Exam Solutons, 23 Page of (b) (4 marks) We have v λ for all S and q j λp j for all j. Let ψ denote the statonary dstrbuton for ths contnuous tme Markov chan. Then ψ satsfes the global balance equatons for the contnuous tme chan: v j ψ j S λψ j S ψ j S ψ q j ψ λp j ψ p j, or or for all j S. Thus, we see that ψ satsfes the global balance equatons for the dscrete tme Markov chan {X n : n }. Snce ths statonary dstrbuton s unque, we must have ψ π. 5. (15 marks) (a) (9 marks) The soluton here s essentally the same as the soluton to Problem 2 of Assgnment 5, for t < 3, except here that soluton works for all t. (b) ( marks) Let W denote the total watng tme of all customers who arrve before the frst server arrves and let T denote the arrval tme of the frst server. Then, we have that T s Exponentally dstrbuted wth rate µ and E[W T t] E[W t ] λt 2 /2, so E[W ] E[W T t]ft (t)dt λt 2 2 µe µt dt λ 2 E[T 2 ] λ 2 2 µ λ 2 µ. 2