Senile reinforced random walks

We consider random walks with transition probabilities depending only on the number of consecutive traversals n of the edge most recently traversed. Such walks may get stuck on a single edge, or have every vertex recurrent or every vertex transient, depending on the reinforcement function f(n) that characterizes the model. We prove recurrence/transience results when the walk does not get stuck on a single edge. We also show that the diffusion constant need not be monotone in the reinforcement.