On Number of Turns in Reduced Random Lattice Paths

Yunjiang Jiang, Weijun Xu

We consider the tree-reduced path of symmetric random walk on $\ZZ^{d}$. It is interesting to ask about the number of turns $T_n$ in the reduced path after $n$ steps. This question…