Work

Recurrence of edge-reinforced random walk on a two-dimensional graph

Year: 2009
Type: article
Abstract: We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from ℤ2 by replacing every edge by a sufficiently large, but fixed number of edges in series. We prove that the linearly edge-reinforced random walk on these graphs is recurrent. Furthermore, we derive bounds for the probability that the edge-reinforced random walk hits the boundary of a large box before returning to its starting point.
Language: English
Open Access status: bronze
OpenAlex ID: W2010052467
FWCI: 2.871
Cites: 12
Cited by: 54
Related to: 8