Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Spring 2018 # 5. Consider a system consisting of two devices (working independently of each other) that can both take the values broken and functioning.

image text in transcribed

Spring 2018 # 5. Consider a system consisting of two devices (working independently of each other) that can both take the values broken and functioning. Every day the individual devices break down with probabilities p, and P2 , respectively. The system is inspected every morning and broken devices (if any) are replaced by the following morning. The state of the system on the morning of day n can be described by a Markov chain with the four states (0,0), (0, 1), (1, 0), (1,1), where () = broken and 1 = functioning. Let X(n) denote the state of the system on day n and assume that no device is broken on the morning of day n=0. (a) Find the possible transitions of the four state Markov chain and draw the transition diagram of the chain without transition probabilities. (b) Find the transition matrix of this Markov chain. (c) Compute the distribution of X(1), i.e., ind P(X(1) = (i, j)), with i, j = 0, 1. = lim P(X(n)=(i, j)), i, j=0, 1 be the limiting distribution of X(n). Show that the solution to (d) Let Tij the system of equations for the probabilities 10,0, 10,1, 11,0, and 11,1 is given by l- il-j i, j = 0,1. (1+ p.)(1+ p2) Spring 2018 # 5. Consider a system consisting of two devices (working independently of each other) that can both take the values broken and functioning. Every day the individual devices break down with probabilities p, and P2 , respectively. The system is inspected every morning and broken devices (if any) are replaced by the following morning. The state of the system on the morning of day n can be described by a Markov chain with the four states (0,0), (0, 1), (1, 0), (1,1), where () = broken and 1 = functioning. Let X(n) denote the state of the system on day n and assume that no device is broken on the morning of day n=0. (a) Find the possible transitions of the four state Markov chain and draw the transition diagram of the chain without transition probabilities. (b) Find the transition matrix of this Markov chain. (c) Compute the distribution of X(1), i.e., ind P(X(1) = (i, j)), with i, j = 0, 1. = lim P(X(n)=(i, j)), i, j=0, 1 be the limiting distribution of X(n). Show that the solution to (d) Let Tij the system of equations for the probabilities 10,0, 10,1, 11,0, and 11,1 is given by l- il-j i, j = 0,1. (1+ p.)(1+ p2)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Finance At 40 Financial Intelligence

Authors: MOIRA O'NEILL Moira O'Neill

1st Edition

1408101114, 978-1408101117

More Books

Students also viewed these Finance questions