Posted by ubpdqn on March 10, 2012
The Gambler’s Ruin problem was another topic of Professor Blitzstein’s STAT110 lectures. There are a number of interesting aspects to this problem. It is a random walk on a directed finite graph with two terminal absorbing nodes (ruin or success).
I explore this in a CDF embedded in this post.
A snapshot is seen below.
I hope more of Professor Blitzstein’s teaching becomes generally available…for now back to the grindstone…