These expressions are solutions to partial differential equations (PDEs) of second and third order, respectively, and such solutions appear in Conformal field theory (CFT) as boundary correlation functions. We obtain conformally covariant expressions for the scaling limit probabilities of certain UST branch connectivities and of LERW boundary visits. In the first publication of this thesis, we study two related random models, the uniform spanning tree (UST) and the loop-erased random walk (LERW). We take a mathematical approach, formalizing our results in terms of SLE type conformally invariant random curves or certain expected values, called boundary correlation functions in physics. Such studies are motivated by quantum field theoretic predictions that suggest the emergence of intricate, conformally invariant structures from simple combinatorial models. These tools are applied to characterize the scaling limits of multiple curves in various random models, such as multiple UST branches.Ībstract = 'This thesis studies scaling limits of critical random models on planar graphs, when a fine-mesh graph approximates a planar domain.

Second, we show how such limits can be described by iteratively sampling the curves one by one from the weighted one-curve SLE(k) measures described above. We first provide a result that guarantees at least subsequential convergence to some limiting random curves, given certain standard crossing estimates in the lattice models. The third and fourth publication concern the weak convergence of the joint law of multiple lattice curves to multiple SLE type random curves. In the second publication, we elaborate this connection by finding an explicit relation between certain multiple SLE(k) weights, called pure partition functions, and certain CFT boundary correlation functions, called conformal blocks. The PDE solutions from the first publication can also be interpreted as weights that conjecturally convert the SLE(2) random curve measure, the scaling limit of a UST branch and a LERW, to multiple or boundary-visiting SLE(2). CFT predicts such PDEs of arbitrarily high order, and this is among the first verifications of higher-than-second order PDEs. This thesis studies scaling limits of critical random models on planar graphs, when a fine-mesh graph approximates a planar domain.

Lattice math set theory