Absorbing Markov Chains, Total Probabilities and Recursion

This video forms part one of a two part video series introducing absorbing Markov Chains and how to deal with them, both with recursion techniques and via transition matrices. In this first video we introduce the concept of absorbing states via a game where a brave knight has to try and rescue a princess and live happily ever after (absorbing state P) before being eaten by a dragon (absorbing state D). We show how to calculate his probability of success given various scenarios.
The second video, entitled 'Absorbing Markov Chains Solved with Transition and Solution Matrices' can be found at • Absorbing Markov Chain...
For more videos on Markov chains see our playlist 'Markov Chains' at • Markov Chains
For more videos on recursion, see our playlist 'Recursion' at • Recursion
For more videos on GRE Subject Maths see our playlist 'GRE Subject Maths' at
• GRE Subject Maths
For more undergraduate maths videos see our playlist 'Undergraduate Maths' at • Undergraduate Maths

[@grestyacademy]

For more videos on Markov Chains, check out the Gresty Academy playlist 'Markov Chains' at ua-cam.com/play/PLlX3COjsHPVDkTC3MENgdITlfCnKy3fxK.html

[@oroboros4858]

Thanks a lot, this video really helped me out with interview prep

[@grestyacademy]

Nice to hear - thanks for the feedback and good luck! Note that there is a 'Part Two' to this video, entitled 'Absorbing Markov Chains Solved with Transition and Solution Matrices', which can be found at ua-cam.com/video/WxCBILZt_0U/v-deo.html