No title
A stochastic process called vertex-reinforced random walk (VRRW) is defined in Pemantle [Ann. Probab. 16 1229-1241]. We consider this process in the case where the underlying graph is an infinite chain (i.e., the one-dimensional integer lattice). We show that the range is almost surely finite, that at least five points are visited infinitely often almost surely and that with positive probability t
