We use the known convergence of loop-erased random walk to radial SLE(2) to give a new proof that the scaling limit of loop-erased random walk excursion in the upper half-plane is chordal SLE(2). Our proof relies on a version of Wilson’s algorithm for weighted graphs which is used together with a Beurling-type estimate for random walk excursion. We also establish and use the convergence of the radial SLE path to the chordal SLE path as the bulk point tends to a boundary point. In the final section we sketch how to extend our results to more general simply connected domains.

No abstract uploaded!

Let each point of a homogeneous Poisson process in ℝ^{$d$}independently be equipped with a random number of stubs (half-edges) according to a given probability distribution$μ$on the positive integers. We consider translation-invariant schemes for perfectly matching the stubs to obtain a simple graph with degree distribution$μ$. Leaving aside degenerate cases, we prove that for any$μ$there exist schemes that give only finite components as well as schemes that give infinite components. For a particular matching scheme which is a natural extension of Gale–Shapley stable marriage, we give sufficient conditions on$μ$for the absence and presence of infinite components.

In an infinite sequence of independent identically distributed continuous random variables we study the number of strings of two subsequent records interrupted by a given number of non-records. By embedding in a marked Poisson process we prove that these counts are independent and Poisson distributed. Also the distribution of the number of uninterrupted strings of records is considered.

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.