1. Posts in the subject areas are now being moderated. Please do not post any details about your exam for at least 3 working days. You may not see your post appear for a day or two. See the 'Forum help' thread entitled 'Using forums during exam period' for further information. Wishing you the best of luck with your exams.
    Dismiss Notice

IAI CT4 Nov 2005

Discussion in 'CS2' started by Srijana Raghunath, Apr 13, 2020.

  1. 1.PNG

    2.PNG
    Why is P(k=7) calculated that way?
     
  2. Andrew Martin

    Andrew Martin ActEd Tutor Staff Member

    Hello

    To get three defeats in a row at the end of seven weeks the last four results must be WLLL. So our outcomes look like:

    XXXWLLL

    XXX here can be any combination of wins and losses except for three losses in a row (as then the coach would already have been fired). So, the probability is:

    Prob[WLLL] * Prob[anything in a run of three except LLL]
    = 0.8 * 0.3^3 * (1 - 0.2^3)

    Alternatively, you can think about all the possibilities, which are:

    WWWWLLL
    LWWWLLL
    WLWWLLL
    WWLWLLL
    LLWWLLL
    LWLWLLL
    WLLWLLL

    Adding up the probabilities for each of these will give the same answer.

    I hope this helps.

    Andy
     
  3. I am again solving this problem after this long and I still have a doubt.
    Since it's a markov chain, we are not bothered about the past wins or loses. We apply that for the calculations when k = 3, 4, 5, 6. But why for k=7, we are keeping track of past wins or loses? Should not it be just WLLL?
     
  4. Andrew Martin

    Andrew Martin ActEd Tutor Staff Member

    Hello

    As the chain is Markov, this means that the future transition probabilities only depend on the current state, not the past of the process. That isn't to say that we're not concerned with the past of the process at all. To work out the probability of a particular series of jumps occurring, we have to consider every jump, not just the ones at the end.

    Although the solutions don't necessarily present it in this manner, we do consider the full path of the process for k=3,4,5 and 6. For example, when k=3, the possibilities are:

    LLL

    The probability of this is 0.2^3

    when k = 4, the possibilities are:

    WLLL

    the probability of this is 0.8*0.2^3

    When k = 5, the possibilities are:

    WWLLL
    LWLLL

    The probabilities of these are 0.8^2*0.2^3 and 0.8*0.2^4 respective. The sum of these is:

    0.8^2 + 0.2^3 + 0.8 * 0.2^4 = 0.8*0.2^3 * (0.8 + 0.2) = 0.8*0.2^3

    This happens to be the probability of WLLL (and hence possibly the confusion). This is because although we need the path to end in WLLL, for k = 5 it doesn't matter what comes before it - we can have either W or L as the first outcome.

    For k = 6, the possibilities are:

    WWWLLL
    WLWLLL
    LWWLLL
    LLWLLL

    Again, although we need WLLL at the end of 6 games, the first two results don't matter (it can be any of the four possible combinations of outcomes for two games). So the probability is again just the probability of WLLL. You can check this using the actual numbers like I did for k=5 and adding up all the probabilities.

    Now, for k = 7 we need WLLL at the end of 7 games. So we have three results to think about before the WLLL. However, this time the results before WLLL DO matter. In particular, we can't have LLLWLLL, as this would mean the coach was fired after 3 weeks, not after 7 weeks. So we need to take this into account.

    Hope this helps

    Andy
     

Share This Page