We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from ℤ² by replacing every edge by a sufficiently large, ...

This is a preview. Log in through your library . Abstract We consider the shortest paths between all pairs of nodes in a directed or undirected complete graph with edge lengths which are uniformly and ...