Lecture #4: Solved Examples of Markov Chain using TPM (Part 3 of 3)
HTML-код
- Опубликовано: 11 сен 2024
- For Book: See the link amzn.to/2NirzXT
This lecture explains how to Solve the Problems of the Markov Chain using TRANSITION PROBABILITY MATRIX. #OptimizationProbStat
Other videos @DrHarishGarg
Lecture 1: Markov Chain & TPM: • Lecture #1: Stochastic...
Lecture 2: Problems using TPM Part 1: • Lecture #2: Solved Pro...
Lecture 3: Problems using TPM Part 2: • Lecture #3: Solved Pro...
Lecture 4: Problems using TPM Part 3: • Lecture #4: Solved Exa...
Lecture 5: Stationary Probabilities: • Lecture #5: Stationary...
Lecture 6: Chapman-Kolmogorov Equation & Theorem: • Chapman-Kolmogorov Equ...
In our country, most doctorate degree prof doesn't know how to teach and they are not interested. But u are passionate and interested in teaching students. Thank u sir
Thank you dear... ❤🙏 its my pleasure to teach all of you.....
You are so awesome Dr. Harish Garg, I was trying to learn from youtube how to solve these kind of problems and your playlist is super precise and very well explained. It took me 2 hours to find your playlist in youtube and I am not kidding you, I learned the way to solve these kind of problems faster than what it took me to find your channel and about 10x faster than the time I spent reading the theory and not understanding a single thing because there where no examples.
Many thank Jim for watching....kindly share with others too so that they will also learn in a simpler manner.... Happy learning.
Sir now only I got clear on Markov chain problems, thanking you sir 🙏🙏🙏
Wow.... So nice and happy.... Happy learning....
Kindly share the videos with other so that they can also learn easily
@@DrHarishGarg sure sir
You r great sir...!!!explanation r so much easy..
I request u... Plz sir,, make a video about classification of state...i hope u will solve this type of problems Step by step ❤...sir plz...plz...plz........
Really explained very clearly. Thank you so much 🙏🙏🙏
Thanks for liking the content.
@@DrHarishGarg thank you sir u helped a lot
Its my pleasure..... Kindly share it with others too
You are the life saver
It's my pleasure.... Watch others lectures and share with others
I think there's a mistake in the last example, you used q0 instead of q1
i thought so too, i think he should clarify
No need to comment for any mistake or error just learn the correct things whatever sir explained. Once you understand, you will be able to correct that by yourselves.
Sir, I have a doubt.
In finding, P(X_3=3,X_1=1)
For this we have to find P_13^(2) .q_1(1) only right. But in your video, you found P_13^(2) .q_0(1). Why sir? I can't understand. Please explain.
Yes, you are right
As always explanation in very nice and simple manner.
So nice of you. Keep watching and sharing other videos also
Thank you Dr. Harish for clear explanation of Markov Chains (3/3 videos)
You're most welcome. Keep watching
Thank you very much for such clear and crisp explanation. Really appreciate your efforts.👍
Its my pleasure .... Many thanks for watching.
Really all those examples are very easy to understand ji...
Happy learning.... Keep sharing and watch other topics also in the easiest manner.
Nobody taught like u
Thank u sir
Thank u so so much! 🙏
Good explanation
Helping me a lot for sem exam preparations 👏👏
Happy to help... Keep watching
Thank you sir for amazing lecture series. I am maths student but finding statistics very interesting & easy because of you. Thanks a lot sir.
It's my pleasure... Glad to hear that
Excellent as usual!!!
excellent videos...very clearly explained thanks a lot..
My pleasure.... Keep watching other videos too
Sir, can you please tell me do you provide tution for bsc statistics because I love the way you teach and I need your guidance in statistics so I am asking , please reply.
Very well explained with examples
Many thanks
I really love your teachings ❤🎉i wish i noticed your channel earlier😊😊😊😊
thanks a lot sir! These markov chain lectures helped me a lot for my sem exams🙏.
Wow... Thats so nice.... Thanks for watching.... Keep in touch always
sir
please explain the last example in the comment
in the last example can we use conditional probability from the 2nd lecture of the this series
Excellent explanation as always.
Thank you for all 4 videos
Clearly explained 👍
So nice of you... Glad you liked them.... You may Watch Lecture 5 and 6 too... Details as below:
Lecture 5: Stationary Probabilities: ruclips.net/video/zVCB49HYIxM/видео.html
Lecture 6: Chapman-Kolmogorov Equation & Theorem: ruclips.net/video/TptjhklRnqM/видео.html
Thanku for the video sir
It is very helpful 🙏
Amazing explaination
I'm getting confused in the last question 😕, it's some what similar to the 2nd method of solving Markov's chain
i have the same dought if we use the condition probability we get only 0.34
Nice presentation professor
Many thanks. Keep watching and sharing
Thanks a lot sir, once again
Thank you Soo much sir
My pleasure
Thanks a lot sir❤️🫡
Awesome sir
i had a question to find unit fixed probability vector of the Matrix
how can i do that?
Thanks
I think there is a smalll mistake in last examle, first we should consider,, (q0*P)(1) * P^2(13)
Sir P(X1=3) Kya hoga?
Informative content
Thanks
Sir please tell me what book have to purchase for basic stochastic processes
As such there are so many books on stochastic processes....if you want to buy then you can choose any one. All books are good.
For Book: See the link amzn.to/2NirzXT
Thanks 👍😊
Thank you too
Sir last example me P(X3=1, X1=1)
Me
q1(1) use hoga?????
Yes
in he last example; P(x3=3,x1=1) , shouldnt we first calculate q1(1)?
Yes, you need to compute q1(1)...
@@DrHarishGarg sir video description mein update kardiya karo please
WOW
🌷🌷🌷
Many thanks....
Join my telegram link of Probability and Statistics
t.me/gargProbability
hi sir can you give us solution form transition matrices
Let Xn ∈ Z≥0 be the amount of water (say measures in the unit of hundred
million gallons) in MacRitchie Reservoir at noon on day n. During the 24 hours period beginning at
this time, Yn ∈ Z≥0 units of water flows into the reservoir. The maximum capacity of the reservoir
is 5 units, and excessive inflows are spilled and lost. Just before noon on each day, exactly 1 unit of
water is removed if the reservoir is non-empty, and no water is removed if the reservoir is dried up.
Assume that Y1, Y2, . . . are iid discrete RVs, where1
Pr(Y1 = 0) = 1\4
, Pr(Y1 = 1) = 1\6
,
Pr(Y1 = 2) = 1\12
2
, Pr(Y1 = 3) = 1\6
, Pr(Y1 = 4) = 1\3
.
In fact, {Xn}
∞
n=1 forms a DTMC. Write down the transition probability matrix of the DTMC
👍👍
Last example is wrong. We need to find q1 of state 1 by using q1=q0*p and than use state 1 from 1 as our probability
Thanks
@@DrHarishGarg btw thanks sir for the great videos learnt it off you only.
My pleasure dear always.... Keep watching other videos too and share with others. Thanks and cheers
Zero to jero
Thank you so much, sir ji🙏
Thank you so much sir.
My pleasure.... Keep watching and sharing