Planar self-avoiding walk scaling limit

Still openEvidence checked

Subjects: Analysis and dynamics · Probability

Collections: Random geometry

Reading depth

The problem

Draw a path along a square grid without visiting any vertex twice. After connecting two marked boundary points and making the grid finer, does its random shape approach one continuous-curve law? The question uses critical weights for different path lengths and asks about the shape with the timing of the steps forgotten.[1] [2]

Scope

Chordal critical nearest-neighbor self-avoiding walks in square-lattice approximations of bounded simply connected planar domains with smooth boundaries, between two distinct marked boundary points. Normalize weights μ^(−length), where μ is the square-lattice connective constant; consider curve traces modulo parametrization.

What remains open

There is a precise candidate for the continuous curve, but resemblance in simulations does not prove that the square-grid paths converge to it. Results for the outer edge of an ordinary random walk concern a different object, which can revisit vertices before its frontier is extracted.[1] [2] [3]

Why it matters

A polymer chain cannot place two of its parts at the same location in this idealized grid model. Self-exclusion makes choices far along the chain depend on earlier steps. A continuum law would explain the resulting large-scale shape without retaining every microscopic grid turn.[1] [2]

Definitions

3 terms
connective constant

The exponential growth rate of the number of long self-avoiding walks from a fixed vertex on the chosen lattice. Its reciprocal gives the critical weight per step; the square-lattice value need not be known exactly to state the question.[1] [2]

chordal

Boundary to boundary: the random curve joins two distinct marked boundary points of a planar region. This differs from a curve with an interior endpoint or a closed loop.[1]

conformal

Angle-preserving. The conjectured continuum curve law should transform consistently when an angle-preserving map changes the planar region and endpoints; that symmetry is not already proved for these square-grid walks.[1] [2]

Sources

  1. On the scaling limit of planar self-avoiding walk Gregory F. Lawler, Oded Schramm and Wendelin Werner · 2002-04-23
    Notes on On the scaling limit of planar self-avoiding walk

    Defines critical chordal measures and gives conditional SLE identification.

  2. Self-avoiding walk, spin systems and renormalization Gordon Slade · 2019-01-23
    Notes on Self-avoiding walk, spin systems and renormalization

    Researcher review distinguishes conjectured planar scaling limits.

  3. Convergence in natural parametrization of random walk frontier Yifan Gao, Xinyi Li, Runsheng Liu, Xiangyi Liu and Daisuke Shiraishi · 2026-02-04
    Notes on Convergence in natural parametrization of random walk frontier

    Published progress for random-walk frontiers leaves self-avoiding walks distinct.

Related problems

Suggest a correction