Let belong to an irreducible recurrent Discrete-time Markov chain. Write and . DefineThe positive return convention is essential: itself is zero when starting at . Let count visits to before the first positive return to , including repeated holding visits at . ThenWith Probability the excursion reaches . From each visit there, the Strong Markov property gives Probability of hitting before the next return to . recurrence ensures there is no third possibility of escaping both states forever. Thus, conditional on reaching , the visit count has a positive-support geometric distribution with mean .
Articles by others on the same topic
There are currently no matching articles.