Recurrence of edge-reinforced random walk on a two-dimensional graph (Q1035859): Difference between revisions

The paper deals with a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant weights. Here one discusses some questions related to a reinforced random walk on non-tree graphs. One proves that the linearly edge-reinforced random walk on these graphs is recurrent. To this end one uses the concept of a \(r\)-diluted version of a given graph which is obtained by replacing every edge by \(r\) edges. By this way, the recurrence is simpler to be proven.