Edge-reinforced random walk on a ladder

Abstract

We prove that the edge-reinforced random walk on the ladder $\mathbb{Z}\times \{1,2\}$ with initial weights $a>3/4$ is recurrent. The proof uses a known representation of the edge-reinforced random walk on a finite piece of the ladder as a random walk in a random environment. This environment is given by a marginal of a multicomponent Gibbsian process. A transfer operator technique and entropy estimates from statistical mechanics are used to analyze this Gibbsian process. Furthermore, we prove spatially exponentially fast decreasing bounds for normalized local times of the edge-reinforced random walk on a finite piece of the ladder, uniformly in the size of the finite piece.

Published at http://dx.doi.org/10.1214/009117905000000396 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (2)

• Bayesian analysis for reversible Markov chains
• Vertex-reinforced random walk on Z eventually gets stuck on five points

Cited by in corpus (10)

• A survey of random processes with reinforcement
• An asymptotic result for Brownian polymers
• Attracting edge and strongly edge reinforced walks
• Linearly edge-reinforced random walks
• Localization for a nonlinear sigma model in a strip related to vertex reinforced jump processes
• Attraction time for strongly reinforced walks
• Asymptotic behavior of edge-reinforced random walks
• Reinforced random walk
• Non-homogeneous random walks with non-integrable increments and heavy-tailed random walks on strips
• Monotonicity and phase transition for the VRJP and the ERRW