Favorite sites of one-dimensional transient random walk

In this paper, we study favorite sites of one-dimensional transient random walk on $\mathbb{Z}$ beyond the simple case. Denote by $\mathcal{K}(n)$ the set of favorite sites at time $n$. The goal of this paper is twofold. First, we study $\mathrm{\#}\mathcal{K}(n)$, the cardinality of $\mathcal{K}(n)$, and show that, under some mild conditions, for any positive integer $k$, $\mathbf{P}(\mathrm{\#}\mathcal{K}(n)=k,\mathrm{i}\mathrm{.}\mathrm{o}\mathrm{.})=1$, and ${\mathrm{lim\hspace{0.17em}sup}}_{n\to \mathrm{\infty }}\mathrm{\#}\mathcal{K}(n)\mathrm{/}\log \log n=-1\mathrm{/}\log \gamma$, where $\gamma$ is the probability that the random walk never returns to the starting point. Second, we study the escape rate of favorite sites, and give the limsup and liminf behaviors, where the liminf behavior is characterized via an integral test. To the best of our knowledge, this integral test is the first result of this nature for random walks (in non-random environments).