Affordable Access

The gambler's ruin problem for a Markov chain related to the Bessel process



We consider a Markov chain for which the probability of moving from n to n+1 depends on n. We calculate the probability that the chain reaches N before 0, as well as the average duration of the game. We also consider a diffusion process which is a limiting case of the Markov chain.

There are no comments yet on this publication. Be the first to share your thoughts.