Claims

../

1990_09_01_revesz: Proves, in his 1990 monograph, two-sided exponential bounds on the distribution of the time a planar simple random walk needs to cover a disc, which give the covered radius its typical scale; credited by the site.

2001_07_26_dembo_peres_rosen_zeitouni: Proves the Kesten–Révész conjecture that the planar disc cover time has an exponential limit of rate 4 on the log-squared scale, which inverts to the limit law of the largest origin-centered disc covered by time n; refereed.

2026_08_26_alexeev: A Lean development in Alexeev's repository proves that the logarithm of the pathwise covered radius of planar simple random walk has two-sided order the square root of log n in probability; not built or audited here.

---