Open Access
2021 A note on once reinforced random walk on ladder Z×{0,1}
Xiangyu Huang, Yong Liu, Vladas Sidoravicius, Kainan Xiang
Author Affiliations +
Electron. Commun. Probab. 26: 1-12 (2021). DOI: 10.1214/21-ECP407

Abstract

Given any δ(0,), let (Xn)n=0 be the δ-once reinforced random walk on ladder Z×{0,1} with the following edge weight function at the (n+1)-th step:

wn(e)=1+(δ1)I{N(e,n)>0}=1ifN(e,n)=0,δifN(e,n)>0.

Here N(e,n):=#{i<n:XiXi+1=e} is the number of times that edge e has been traversed by the walk before time n. It was proved that (Xn)n=0 is almost surely recurrent for δ>12 (Vervoort (2002) [8] and Sellke (2006) [7]), while the a.s. recurrence for negative reinforcement factor δ(0,12] remained open. In this note, we give an affirmative answer to this question.

Funding Statement

Y. Liu is supported by CNNSF (No. 11731009, No.11926327) and Center for Statistical Science, PKU. K. Xiang is supported by CNNSF (No. 11671216) and by Hu Xiang Gao Ceng Ci Ren Cai Ju Jiao Gong Cheng-Chuang Xin Ren Cai (No. 2019RS1057).

Acknowledgments

We thank the anonymous referees and the editor for their comments which improved greatly the quality of the paper, and thank Prof. Pierre Tarrès, Prof. Yuan Zhang for their suggestions and Dr. Yuelin Liu for her helps.

Citation

Download Citation

Xiangyu Huang. Yong Liu. Vladas Sidoravicius. Kainan Xiang. "A note on once reinforced random walk on ladder Z×{0,1}." Electron. Commun. Probab. 26 1 - 12, 2021. https://doi.org/10.1214/21-ECP407

Information

Received: 9 October 2020; Accepted: 2 June 2021; Published: 2021
First available in Project Euclid: 22 June 2021

Digital Object Identifier: 10.1214/21-ECP407

Subjects:
Primary: 60K35

Keywords: ladder , once reinforced random walk , recurrence

Back to Top