[SOLVED] MTH371 Assignment 2

30.00 $

Category: Tags: ,
Click Category Button to View Your Next Assignment | Homework

You will receive the following solution file(s) instantly after successful payment:

zip file icon Assignment-2-cmrjf9.zip (663.4 KB)
Assignment Instructions Updated Recently? Submit Below and we will provide new Solution!
Submit New Instructions
🔒 Securely Powered by:
Secure Checkout
Rate this product
  1.  Suppose the interarrival times of a renewal process have the geometric distribution with success probability p. Then the interarrival times are nonnegative integers, and sum of interarrival times is Sn = X1 + . . . + Xn. Answer the following.

    (a) Simulate sum of interarrival times with p = 0.2.
    (b) Simulate Nt and estimate E(Nt) for various values of t. Use p = 0.2.

  2. Let there be a discrete time Markov chain with the state space S = {0, 1, . . . , 7}. The one step transition probability is given by

1/32/30 0 0 1/31/31/300 0 1/3 1/3 1/3 0

0 0 P=0 0

0 0  0 0

0 0 0 0 0 0 2/3 1/3 1

1/3 1/3 1/3 0
0 1/3 1/3 1/3
0 0 1/3 1/3 1/3 0 0 0 0 1 / 3 1 / 3 1 / 3 

0 0 0

0 0 0 0 0 0 0 0 0 0

It is given that when the process starts the MC was in state 0. Answer the following.

(a) Simulate five times a 50 steps Markov chain. Construct a plot com- paring time to the states of the process.

(b) What will be P10, P20, P50. What do you observe.

2

  • Assignment-2-cmrjf9.zip