2008/09/30 by Ariel Yadin, Amir Yehudayoff · 1 citation
Mathematics · Physics and Astronomy · #Brownian motion #Combinatorics #Complex Network Analysis Techniques #Discrete mathematics #Geometry #Graph #Limit (mathematics) #Loop-erased random walk #Mathematical analysis #Mathematics #Percolation (cognitive psychology) #Planar graph #Poisson distribution #Random graph #Random walk #Scaling #Scaling limit #Stochastic processes and statistical mechanics #Theoretical and Computational Physics #math-ph #math.MP #math.PR
paper · pdf · doi:10.1214/10-aop579
published as Annals of Probability 2011, Vol. 39, No. 4, 1243-1285 · Published in at http://dx.doi.org/10.1214/10-AOP579 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)
openalex publication_date 2011/07/01 · arxiv created 2012/11/15 · arxiv updated 2012/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on ℤ2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into ℂ so that edges do not cross one another). We show that if the scaling limit of the random walk is planar Brownian motion, then the scaling limit of its loop-erasure is SLE2. Our main contribution is showing that for such graphs, the discrete Poisson kernel can be approximated by the continuous one. One example is the infinite component of super-critical percolation on ℤ2. Berger and Biskup showed that the scaling limit of the random walk on this graph is planar Brownian motion. Our results imply that the scaling limit of the loop-erased random walk on the super-critical percolation cluster is SLE2.