Schramm's formula for multiple loop-erased random walks
arXiv:1801.03126 · doi:10.1088/1742-5468/aae5a6
Abstract
We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a line bundle Laplacian is defined. We give explicit results in the scaling limit for the upper half-plane, the cylinder and the Moebius strip. Schramm's formula is then extended to multiple loop-erased random walks.
arXiv comment59 pages, 19 figures. v2: reformulation of Section 2.3, minor corrections
References in corpus (20)
- Critical Percolation in Finite Geometries
- Conformal Field Theories of Stochastic Loewner Evolutions
- Multiple Schramm-Loewner Evolutions and Statistical Mechanics Martingales
- Spanning forests and the vector bundle Laplacian
- Boundary Partitions in Trees and Dimers
- Euler integrals for commuting SLEs
- SLE_k growth processes and conformal field theories
- Conformal restriction, highest-weight representations and SLE
- Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on planar graphs
- The Gaussian free field and SLE(4) on doubly connected domains
- On conformal field theory of SLE(kappa; rho)
- Defining SLE in multiply connected domains with the Brownian loop measure
- Twist operator correlation functions in O(n) loop models
- Non-unitary observables in the 2d critical Ising model
- The scaling limit of two cluster boundaries in critical lattice models
- Convergence of Ising interfaces to Schramm's SLE curves
- Finite-size left-passage probability in percolation
- Three-leg correlations in the two component spanning tree on the upper half-plane
- A generalisation of Schramm's formula for SLE(2)
- Pfaffian formulas for spanning tree probabilities