No abstract uploaded!

Let $D={\mathbb H} \setminus \cup_{k=1}^N C_k$ be a standard slit domain where $\mathbb H$ is the upper half plane and $C_k$, $1\leq k\leq N$, are mutually disjoint horizontal line segments in $\HH$. Given a Jordan arc $\gamma\subset D$ starting at $\partial {\mathbb H},$ let $g_t$ be the unique conformal map from $D\setminus \gamma[0,t]$ onto a standard slit domain $D_t$ satisfying the hydrodynamic normalization. We prove that $g_t$ satisfies an ODE with the kernel on its righthand side being the complex Poisson kernel of the Brownian motion with darning (BMD) for $D_t$, generalizing the chordal Loewner equation for the simply connected domain $D={\mathbb H}.$ Such a generalization has been obtained by Y. Komatu in the case of circularly slit annuli and by R. O. Bauer and R. M. Friedrich in the present chordal case, but only in the sense of the left derivative in $t$. We establish the differentiability of $g_t$ in $t$ to make the equation a genuine ODE. To this end, we first derive the continuity of $g_t(z)$ in $t$ with a certain uniformity in $z$ from a probabilistic expression of $\Im g_t(z)$ in terms of the BMD for $D$, which is then combined with a Lipschitz continuity of the complex Poisson kernel under the perturbation of standard slit domains to get the desired differentiability.

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.

General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph ℋ, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and Schur triples in random subsets of integers. In the second part of the paper we return to the subgraph counts in random graphs and provide upper tail estimates in the rooted case.

We determine the asymptotics of the independence number of the random d-regular graph for all d≥d0. It is highly concentrated, with constant-order fluctuations around nα∗−c∗logn for explicit constants α∗(d) and c∗(d). Our proof rigorously confirms the one-step replica symmetry breaking heuristics for this problem, and we believe the techniques will be more broadly applicable to the study of other combinatorial properties of random graphs.