Edge-reinforced random walk on a two-dimensional graph
Seminar Room 1, Newton Institute
AbstractWe consider linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from Z^2 by replacing every edge by a sufficiently large, but fixed number of edges in series. We prove that linearly edge-reinforced random walk on these graphs is recurrent.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.