Laws relating runs, long runs, and steps in gambler's ruin, with persistence in two strata

Abstract

Define a certain gambler's ruin process Xj, \ j 0, such that the increments j:=Xj-Xj-1 take values 1 and satisfy P(j+1=1|j=1, |Xj|=k)=P(j+1=-1|j=-1,|Xj|=k)=ak, all j 1, where ak=a if 0 k f-1, and ak=b if f k<N. Here 0<a, b <1 denote persistence parameters and f ,N∈ N with f<N. The process starts at X0=m∈ (-N,N) and terminates when |Xj|=N. Denote by R'N, U'N, and L'N, respectively, the numbers of runs, long runs, and steps in the meander portion of the gambler's ruin process. Define XN:= ( L'N-1-a-b(1-a)(1-b) R'N-1(1-a)(1-b) U'N )/N and let fη N for some 0<η <1. We show N∞ E\eitXN\=(t) exists in an explicit form. We obtain a companion theorem for the last visit portion of the gambler's ruin.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…