加载中…
We consider large deviations of the cover time of the discrete torus , by simple random walk. We prove a lower bound on the probability that the cover time is smaller than times its expected value, with exponents matching the upper bound from [Goodman-den Hollander, Probab. Theory Related Fields (2014)] and [Comets-Gallesco-Popov-Vachkovskaia, Electron. J. Probab. (2013)]. Moreover, we derive sharp asymptotics for . The strong coupling of the random walk on the torus and random interlacements developed in a recent work [Prévost-Rodriguez-Sousi, arXiv:2309.03192] serves as an important ingredient in the proofs.

生成讲解博客的中文版本

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