Define a certain gambler’s ruin process such that the increments take values and satisfy $P(\varepsilon_{j+1}=1|\varepsilon_{j}=1, |{j}|=k)=P(\varepsilon{j+1}=-1|\varepsilon_{j}=-1,|_{j}|=k)=a_k$, all , where if , and if . Here denote persistence parameters and with . The process starts at and terminates when . Denote by , , and , respectively, the numbers of runs, long runs, and steps in the meander portion of the gambler’s ruin process. Define $X_N:=\left ({\cal L}‘_N-\frac{1-a-b}{(1-a)(1-b)}{\cal R}’_N-\frac{1}{(1-a)(1-b)}{\cal U}'N\right )/Nf\sim\eta N0<\eta <1\lim{N\to\infty} E{e^{itX_N}}=\hat{\varphi}(t)$ exists in an explicit form. We obtain a companion theorem for the last visit portion of the gambler’s ruin.

生成讲解博客的中文版本

生成AI智能校验的中文版本