No abstract uploaded!

This article focuses on the characterization of global multiple Schramm– Loewner evolutions (SLE). The chordal SLE describes the scaling limit of a single interface in various critical lattice models with Dobrushin boundary conditions, and similarly, global multiple SLEs describe scaling limits of collections of interfaces in critical lattice models with alternating boundary conditions. In this article, we give a minimal amount of characterizing properties for the global multiple SLEs: we prove that there exists a unique probability measure on collections of pairwise disjoint continuous simple curves with a certain conditional law property. As a consequence, we obtain the convergence of multiple interfaces in the critical Ising, FK-Ising and percolation models.

We study the critical Ising model on the square lattice in bounded simply connected domains with + and free boundary conditions. We relate the energy density of the model to a discrete fermionic correlator and compute its scaling limit by discrete complex analysis methods. As a consequence, we obtain a simple exact formula for the scaling limit of the energy field one-point function in terms of the hyperbolic metric. This confirms the predictions originating in physics, but also provides a higher precision.

For Komatu-Loewner equation on a standard slit domain, we randomize the Jordan arc in a manner similar to that of \cite{S} to find the SDEs satisfied by the induced motion $\xi(t)$ on $\partial\HH$ and the slit motion $\s(t)$. The diffusion coefficient $\alpha$ and drift coefficient $b$ of such SDEs are homogenous functions. Next with solutions of such SDEs, we study the corresponding stochastic Komatu-Loewner evolution, denoted as ${\rm SKLE}_{\alpha,b}$. We introduce a function $b_{\rm BMD}$ measuring the discrepancy of a standard slit domain from $\HH$ relative to BMD. We show that ${\rm SKLE}_{\sqrt{6},-b_{\rm BMD}}$ enjoys a locality property.

In a uniform random recursive$k$-directed acyclic graph, there is a root, 0, and each node in turn, from 1 to$n$, chooses$k$uniform random parents from among the nodes of smaller index. If$S$_{$n$}is the shortest path distance from node$n$to the root, then we determine the constant$σ$such that$S$_{$n$}/log$n$→$σ$in probability as$n$→∞. We also show that max_{1≤$i$≤$n$}$S$_{$i$}/log$n$→$σ$in probability.