DOC PREVIEW
MIT 6 041 - Probabilistic Systems Analysis Tutorial 7

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Massachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis (Fall 2010) Tutorial 7 October 28/29, 2010 1. Alice and Bob alternate playing at the casino table. (Alice starts and plays at odd times i = 1, 3, . . .; Bob plays at even times i = 2, 4, . . ..) At each time i, the net gain of wh oever is playing is a random variable Gi with the following PMF: ⎧ ⎪ ⎪ ⎪ 1 31 216g = −2, g = 1, g = 3, ⎨ pG(g) = ⎪ ⎪ ⎪ ⎩ 0 otherwise Assume that the net gains at different times are independent. We refer to an outcome of − 2 as a “loss.” (a) They keep gambling until the first time where a loss by Bob immediately follows a loss by Alice. Write down the PMF of the total number of roun ds played. (A round consists of two plays, one by Alice and then one by Bob.) (b) Write down the PMF for Z, defined as the time at which Bob has his third loss. (c) Let N be the number of rounds until each one of them has won at least once. Find E[N]. 2. Problem 6.6, page 328 in text. Sum of a geometric number of independent geometric random variables Let Y = X1 + · · · + XN , where the random variable Xi are geometric with parameter p, and N is geometric with parameter q. Assume that the random variables N, X1, X2, · · · are independent. Show that Y is geometric with parameter pq. Hint: Interpr et the various random variables in terms of a split Bernoulli process. 3. A train bridge is constructed across a wide river. Trains arrive at the bridge according to a Poisson process of rate λ = 3 per day. (a) If a train arrives on day 0, find the probability that there will be no trains on days 1, 2, and 3. (b) Find the probability that the next train to arrive after the first train on day 0, takes more than 3 days to arrive. (c) Find the probability th at no trains arrive in the first 2 days, but 4 trains arrive on the 4th day. (d) Find the probability that it takes more than 2 days for the 5th train to arrive at the bridge. e 1 of 1 Textbook problems are courtesy of Athena Scientific, and are used with permission.PagMIT OpenCourseWare http://ocw.mit.edu 6.041 / 6.431 Probabilistic Systems Analysis and Applied Probability Fall 2010 For information about citing these materials or our Terms of Use, visit:


View Full Document

MIT 6 041 - Probabilistic Systems Analysis Tutorial 7

Documents in this Course
Quiz 1

Quiz 1

5 pages

Quiz 2

Quiz 2

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

2 pages

Syllabus

Syllabus

11 pages

Quiz 2

Quiz 2

7 pages

Quiz 1

Quiz 1

6 pages

Quiz 1

Quiz 1

11 pages

Quiz 2

Quiz 2

13 pages

Quiz 1

Quiz 1

13 pages

Load more
Download Probabilistic Systems Analysis Tutorial 7
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Probabilistic Systems Analysis Tutorial 7 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Probabilistic Systems Analysis Tutorial 7 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?