加载中…
We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence satisfying for some is recurrent. This improves on previous results of Volkov (2006) and Schapira (2012).

生成讲解博客的中文版本

生成AI智能校验的中文版本