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.
Original language | English |
---|---|
Pages (from-to) | 207-221 |
Journal | Acta Mathematica Hungarica |
Volume | 97 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2002 |