Electronic Communications in Probability

Phase transitions for edge-reinforced random walks on the half-line

Jiro Akahori, Andrea Collevecchio, and Masato Takei

Full-text: Open access


We study the behaviour of a class of edge-reinforced random walks on $\mathbb{Z} _{+}$, with heterogeneous initial weights, where each edge weight can be updated only when the edge is traversed from left to right. We provide a description for different behaviours of this process and describe phase transitions that arise as trade-offs between the strength of the reinforcement and that of the initial weights. Our result aims to complete the ones given by Davis [3, 4], Takeshima [9, 10] and Vervoort [11].

Article information

Electron. Commun. Probab., Volume 24 (2019), paper no. 39, 12 pp.

Received: 27 December 2018
Accepted: 6 May 2019
First available in Project Euclid: 22 June 2019

Permanent link to this document

Digital Object Identifier

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]

self-interacting random walks reinforced random walks

Creative Commons Attribution 4.0 International License.


Akahori, Jiro; Collevecchio, Andrea; Takei, Masato. Phase transitions for edge-reinforced random walks on the half-line. Electron. Commun. Probab. 24 (2019), paper no. 39, 12 pp. doi:10.1214/19-ECP240. https://projecteuclid.org/euclid.ecp/1561169055

Export citation


  • [1] Austin, D. G. (1966). A sample function property of martingales. Ann. Math. Statist. 37, 1396–1397.
  • [2] Coppersmith, D. and Diaconis, P. (1986). Random walks with reinforcement. Unpublished manuscript.
  • [3] Davis, B. (1989). Loss of recurrence in reinforced random walk. Almost Everywhere Convergence 179–188, Academic Press.
  • [4] Davis, B. (1990). Reinforced random walk. Probab. Theory Relat. Fields 84, 203–229.
  • [5] Lyons, R. and Peres, Y. (2016). Probability on trees and networks. Cambridge University Press, New York. Pages xvi+699. Available at http://pages.iu.edu/~rdlyons/.
  • [6] Merkl, F. and Rolles, S. W. W. (2007). A random environment for linearly edge-reinforced random walks on infinite graphs, Probab. Theory Relat. Fields, 138, 157–176.
  • [7] Sabot, C. and Tarrès, P. (2015). Edge-reinforced random walk, vertex-reinforced jump process and the supersymmetric hyperbolic sigma model. J. Eur. Math. Soc. 17, 2353–2378.
  • [8] Sellke, T. (1994). Reinforced random walks on the $d$-dimensional integer lattice. Technical Report, Department of Statistics, Purdue University #94-26. / (2008). Markov Processes Relat. Fields 14, 291–308.
  • [9] Takeshima, M. (2000). Behavior of 1-dimensional reinforced random walk. Osaka J. Math. 37, 355–372.
  • [10] Takeshima, M. (2001). Estimates of hitting probabilities for a 1-dimensional reinforced random walk. Osaka J. Math. 38, 693–709.
  • [11] Vervoort, M. R. (2000). Games, walks and grammers: Problems I’ve worked on. Ph.D thesis, Universiteit van Amsterdam.
  • [12] Williams, D. (1991). Probability with martingales. Cambridge University Press.