Convergence of planar loop-erased random walk to SLE_2

From papers

Let DD be a bounded, simply connected domain containing the origin whose boundary is a Jordan curve, and let U,VU,V be disjoint, closed subarcs of D\partial D. For the lattice approximation An(D)A_n(D), boundary sets Un,VnU_n,V_n, nearest-neighbor path set Kn\mathcal K_n, self-avoiding paths Wn\mathcal W_n^* containing the unordered edge 0,1\\{0,1\\}, and the rescaled measure μ(n)\mu^{(n)} defined above, with μD(0;U,V)\mu_D(0;U,V) the corresponding SLE2SLE_2 path measure, Convergence conjecture. The two arbitrary constants in the definition of μD\mu_D can be chosen so that, for every such D,U,VD,U,V,

limnn3/4,μ(n)=μD(0;U,V).\lim_{n \rightarrow \infty} n^{3/4}\\,\mu^{(n)}=\mu_D(0;U,V).

In particular,

limnηWnp^n(η)=ΨD(0;U,V).\lim_{n \rightarrow \infty}\sum_{\eta\in\mathcal W_n}\hat p_n(\eta)=\Psi_D(0;U,V).

This conjectures the convergence of loop-erased random walk to SLE2SLE_2 in simply connected Jordan domains; the source expects the analogous statement for finitely connected domains as well. The exponent 3/43/4 reflects the boundary scaling exponent for loop-erased walk.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Gregory F. Lawler, “The probability that planar loop-erased random walk uses a given edge”, arXiv:1301.5331 (2013).

Solutions 0

No solutions have been posted yet.