Abstract
Given any , let be the δ-once reinforced random walk on ladder with the following edge weight function at the -th step:
Here is the number of times that edge e has been traversed by the walk before time n. It was proved that is almost surely recurrent for (Vervoort (2002) [8] and Sellke (2006) [7]), while the a.s. recurrence for negative reinforcement factor 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
Xiangyu Huang. Yong Liu. Vladas Sidoravicius. Kainan Xiang. "A note on once reinforced random walk on ladder ." Electron. Commun. Probab. 26 1 - 12, 2021. https://doi.org/10.1214/21-ECP407
Information