Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source and scope. Complete deduction from the stated Theorem 1.4 of Dembo–Peres–Rosen–Zeitouni (2004). That same-paper input is not yet fully reconstructed here, so this deduction does not by itself complete the source proof. Dembo–Peres–Rosen (2007), equation (1.1), restates the resulting tail formula, citing the 2004 Theorem 1.4, in its introduction.

Definitions and conclusion

For the walk in Theorem 1.4 define the path-dependent integer radius

Rn=max⁡{m∈Z≥0:{x∈Z2:∥x∥≤m}⊆{S0,…,Sn}}.R_n=\max\{m\in\mathbb Z_{\ge0}: \{x\in\mathbb Z^2:\|x\|\le m\}\subseteq\{S_0,\ldots,S_n\}\}.

For n≥2n\ge2 put

Yn=(log⁡max⁡{Rn,1})2log⁡n.Y_n=\frac{\bigl(\log\max\{R_n,1\}\bigr)^2}{\log n}.

Then YnY_n converges in distribution to an exponential random variable of rate 44. More explicitly, for each x>0x>0,

P(Yn≥x)⟶e−4x,P(Yn≤x)⟶1−e−4x.\mathbb P(Y_n\ge x)\longrightarrow e^{-4x},\qquad \mathbb P(Y_n\le x)\longrightarrow1-e^{-4x}.

The limiting cumulative distribution at x=0x=0 is also zero.

Complete deduction

First, the cover-time theorem remains valid at a varying threshold. If integers rj→∞r_j\to\infty and tj→t>0t_j\to t>0, then for every 0<δ<t0<\delta<t and all sufficiently large jj,

P(log⁡Trj≤(t−δ)(log⁡rj)2)≤P(log⁡Trj≤tj(log⁡rj)2)≤P(log⁡Trj≤(t+δ)(log⁡rj)2).\mathbb P\bigl(\log T_{r_j}\le(t-\delta)(\log r_j)^2\bigr) \le\mathbb P\bigl(\log T_{r_j}\le t_j(\log r_j)^2\bigr) \le\mathbb P\bigl(\log T_{r_j}\le(t+\delta)(\log r_j)^2\bigr).

Apply Theorem 1.4 to the two outer terms and let δ↓0\delta\downarrow0. Continuity of e−4/te^{-4/t} gives the claimed varying-threshold limit.

Let TmcT_m^{\mathrm c} be the cover time of the closed lattice disc of integer radius mm. Inclusion of the three lattice sets gives

Tm≤Tmc≤Tm+1.T_m\le T_m^{\mathrm c}\le T_{m+1}.

Thus, for any integer sequence mn→∞m_n\to\infty with log⁡n/(log⁡mn)2→t>0\log n/(\log m_n)^2\to t>0, the two open-disc bounds and the varying-threshold observation give

P(Tmnc≤n)⟶e−4/t;\mathbb P(T_{m_n}^{\mathrm c}\le n)\longrightarrow e^{-4/t};

here log⁡(mn+1)/log⁡mn→1\log(m_n+1)/\log m_n\to1 justifies the upper radius shift.

For fixed x>0x>0, set mn=⌈exp⁡(xlog⁡n)⌉m_n=\lceil\exp(\sqrt{x\log n})\rceil. The exact event identities are

{Yn≥x}={Rn≥mn}={Tmnc≤n}.\{Y_n\ge x\}=\{R_n\ge m_n\} =\{T_{m_n}^{\mathrm c}\le n\}.

Since log⁡n/(log⁡mn)2→1/x\log n/(\log m_n)^2\to1/x, the preceding limit is e−4xe^{-4x}. To obtain the cumulative distribution with a non-strict inequality, use mn′=⌊exp⁡(xlog⁡n)⌋+1m_n'=\lfloor\exp(\sqrt{x\log n})\rfloor+1. Then {Yn>x}={Rn≥mn′}\{Y_n>x\}=\{R_n\ge m_n'\} and the same logarithmic ratio holds. Taking complements proves the stated cumulative distribution. For x=0x=0, nonnegativity and P(Yn≤0)≤P(Yn≤δ)\mathbb P(Y_n\le0)\le\mathbb P(Y_n\le\delta) for every δ>0\delta>0 show the limit is zero as δ↓0\delta\downarrow0. No atom or rounding convention changes the conclusion.

Precise meaning of the radius scale

The variable log⁡max⁡{Rn,1}/log⁡n\log\max\{R_n,1\}/\sqrt{\log n} converges in distribution to the square root of an exponential variable of rate 44. For every η>0\eta>0 there are deterministic constants 0<a<b<∞0<a<b<\infty such that

lim inf⁡n→∞P(alog⁡n≤log⁡max⁡{Rn,1}≤blog⁡n)≥1−η.\liminf_{n\to\infty} \mathbb P\bigl(a\sqrt{\log n}\le\log\max\{R_n,1\} \le b\sqrt{\log n}\bigr)\ge1-\eta.

Indeed, choose aa small and bb large enough that e−4a2−e−4b2≥1−ηe^{-4a^2}-e^{-4b^2}\ge1-\eta and apply the continuous limiting law. This makes the typical scale precise; it does not assert almost-sure comparison by constants along an entire infinite trajectory.

Bears on. #1164.