(1) Mathematics Department, Wesleyan University, Middletown, CT, 06459, U.S.A.;(2) University of California dDepartment of Mathematics, Box 951555, Los Angeles, CA, 90095-1555, U.S.A
Abstract:
We introduce the directed-edge-reinforced random walk and prove that the process is equivalent to a random walk in random
environment. Using Oseledec"s multiplicative ergodic theorem, we obtain recurrence and transience criteria for random walks
in random environment on graphs with a certain linear structure and apply them to directed-edge-reinforced random walks.
This revised version was published online in August 2006 with corrections to the Cover Date.