In a one-dimensional random walk, a “walker” is confined to a long, narrow path and moves forward or backward in steps according to the results of repeatedly tossing a coin. The walker takes a step in ...

This is a preview. Log in through your library . Abstract We consider a nearest-neighbor, one dimensional random walk ${X_{n}}_{n}\geq0$ in a random i.i.d ...

For a one-dimensional simple random walk (St), for each time t we say a site x is a favorite site if it has the maximal local time. In this paper, we show that with probability 1 three favorite sites ...