Infinite Paths on a Random Environment of [Formula omitted] with Bounded and Recurrent Sums

This paper considers a random structure on the lattice [Formula omitted] of the following kind. To each edge e a random variable [Formula omitted] is assigned, together with a random sign [Formula omitted]. For an infinite self-avoiding path on [Formula omitted] starting at the origin consider the sequence of partial sums along the path. These are computed by summing the [Formula omitted]'s for the edges e crossed by the path, with a sign depending on the direction of the crossing. If the edge is crossed rightward or upward the sign is given by [Formula omitted], otherwise by [Formula omitted]. We assume that the sequence of [Formula omitted]'s is i.i.d., drawn from an arbitrary common law and that the sequence of signs [Formula omitted] is independent, with independent components drawn from a law which is allowed to change from horizontal to vertical edges. First we show that, with positive probability, there exists an infinite self-avoiding path starting from the origin with bounded partial sums. Moreover the process of partial sums either returns to zero or at least it returns to any neighborhood of zero infinitely often. These results are somewhat surprising at the light of the fact that, under rather mild conditions, there exists with probability 1 two sites with all the paths joining them having the partial sums exceeding in absolute value any prescribed constant.