加载中…
For a one-dimensional simple random walk , for each time we say a site is a favorite site if it has the maximal local time. In this paper, we show that with probability 1 three favorite sites occurs infinitely often. Our work is inspired by T'oth (2001), and disproves a conjecture of Erd"{o}s and R'ev'esz (1984) and of T'oth (2001).

生成讲解博客的中文版本

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