Holmes, M.; Sakai, A. - In: Stochastic Processes and their Applications 117 (2007) 10, pp. 1519-1539
We consider random walks with transition probabilities depending 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...