{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

final07sol

# final07sol - STAT455/855 Fall 2007 Applied Stochastic...

This preview shows pages 1–4. Sign up to view the full content.

STAT455/855 Fall 2007 Applied Stochastic Processes Final Exam, Solutions 1. (15 marks) (a) (11 marks) Let q = P ( X i > m ). This is the same for all X i , and is equal to q = j = m +1 p (1 - p ) j - 1 = (1 - p ) m p j =0 (1 - p ) j = (1 - p ) m p 1 - (1 - p ) = (1 - p ) m . (i) (2 marks) The event { N k = k } occurs if and only if the first k observations are all greater than m . The probability of this is P ( N k = k ) = q k = (1 - p ) mk . (ii) (4 marks) N 1 has a Geometric( q ) distribution and so E [ N 1 ] = 1 q = 1 (1 - p ) m . Conditioning on N 1 , and then on the next observation after N 1 , we have E [ N 2 ] = j =1 E [ N 2 N 1 = j ] P ( N 1 = j ) = j =1 [( j + 1) q + ( j + E [ N 2 ])(1 - q )] P ( N 1 = j ) = j =1 jP ( N 1 = j ) + ( q + (1 - q ) E [ N 2 ]) j =1 P ( N 1 = j ) = E [ N 1 ] + q + (1 - q ) E [ N 2 ] = 1 q + q + (1 - q ) E [ N 2 ] or E [ N 2 ] = 1 + 1 q 2 = 1 + 1 (1 - p ) 2 m .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
STAT 455/855 -- Final Exam Solutions, 2007 Page 2 of 7 (iii) (5 marks) Conditioning on N k - 1 and the next observation after N k - 1 , we have E [ N k ] = j =1 E [ N k N k - 1 = j ] P ( N k - 1 = j ) = j =1 [( j + 1) q + ( j + E [ N k ])(1 - q )] P ( N k - 1 = j ) = E [ N k - 1 ] + q + (1 - q ) E [ N k ] or E [ N k ] = 1 + 1 q E [ N k - 1 ] . Recursing, we obtain E [ N k ] = 1 + 1 q E [ N k - 1 ] = 1 + 1 q + 1 q 2 E [ N k - 2 ] . . . = 1 + 1 q + 1 q 2 + . . . + 1 q k - 2 + 1 q k - 1 E [ N 1 ] = 1 + 1 q + 1 q 2 + . . . + 1 q k - 2 + 1 q k = 1 - 1 /q k - 1 1 - 1 /q + 1 q k = q k - 1 - 1 q k - 1 - q k - 2 + 1 q k = (1 - p ) m ( k - 1) - 1 (1 - p ) m ( k - 1) - (1 - p ) m ( k - 2) + 1 (1 - p ) mk . (b) (4 marks) Let N i , i = 1 , . . . , 6, denote the number of biased dice that show i , and let X denote the outcome of the fair die. Conditioning on X , we have E [ N ] = 6 i =1 E [ N X = i ] 1 6 = 1 6 6 i =1 E [ N i ] = 1 6 E [ N 1 + N 2 + . . . + N 6 ] = n - 1 6 , since N 1 + N 2 + . . . + N 6 n - 1, the total number of biased dice.
STAT 455/855 -- Final Exam Solutions, 2007 Page 3 of 7 2. (15 marks) (a) (11 marks) The Markov chain is irreducible and aperiodic. We will give the stationary distribution of the chain, which shows that it is positive recurrent.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern