We consider a random walker on a d-regular graph. Starting from a fixed vertex, the first step is a unit step in any one of the d directions, with common probability 1/d for each one. At any later ...
This is a preview. Log in through your library . Abstract We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback