Loop-erased random walk and Poisson kernel on planar graphs

From MaRDI portal



Abstract: Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on mathbbZ2 is mathrmSLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into mathbbC 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 mathrmSLE2. 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 mathbbZ2. 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 mathrmSLE2.


The authors focus on the scalling limit of the loop-erased random walk on graphs embedded into \(\mathbb C\). They show that, if the scalling limit of the random walk is a planar Brownian motion, then the scalling limit of its loop-erasure is a one-parameter family of random continuous curves, known as Schramm-Loewner evolution or SLE\(_2\). The authors main contribution is to show that, for such a graph, the discrete Poisson kernel can be approximated by the continuous one.











This page was built for publication: Loop-erased random walk and Poisson kernel on planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q717878)