This chapter consists in a detailed study of a fundamental example of random walk that can only evolve by going up of down by one unit within the finite state space \({\mathbb {S}}= \{ 0 , 1, \ldots , S\}\). This allows us in particular to have a first look at the first step analysis technique that will be repeatedly used in the general framework of Markov chains, particularly in Chap. 5.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Gambling Problems

  • Nicolas Privault

摘要

This chapter consists in a detailed study of a fundamental example of random walk that can only evolve by going up of down by one unit within the finite state space \({\mathbb {S}}= \{ 0 , 1, \ldots , S\}\). This allows us in particular to have a first look at the first step analysis technique that will be repeatedly used in the general framework of Markov chains, particularly in Chap. 5.