Question: Suppose we have a Markov chain that models the spread of a flu virus with population n. Each pair (i,j) comes into contact with each

Suppose we have a Markov chain that models the spread of a flu virus with population n. Each pair (i,j) comes into contact with each other with probability p and infects each other. Also, any person infected for at least 24 hours will recover with probability 0 < q < 1, and return to being susceptible.

Draw a markov chain with as few states as possible to model the spread of the flu for n = 2, and identify all recurrent states.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!