Suppose that is a simple random walk on for and, for each , we let consist of those which have not been visited by by time . Let be the expected amount of time that it takes for to visit every site of . We show that there exists $0 < \alpha_0(d) \leq \alpha_1(d) < 1t_* = \tcov(1+o(1))n \to \infty\alpha > \alpha_1(d)(resp.\\alpha < \alpha_0(d)\U(\alpha t_*)\Z_n^dn^{-\alpha d}0(resp.\1n \to \infty\tau_\alphat|\U(t)| = n^{d-\alpha d}$. We also show that the total variation distance between the law of and the law of a uniformly chosen set from with size tends to (resp.\ ) for (resp.\ ) as .

生成讲解博客的中文版本

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