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.

We consider the KPZ equation in one space dimension driven by a sta- tionary centred space–time random field, which is sufficiently integrable and mixing, but not necessarily Gaussian. We show that, in the weakly asymmetric regime, the solution to this equation considered at a suitable large scale and in a suitable reference frame converges to the Hopf–Cole solution to the KPZ equation driven by space–time Gaussian white noise. While the limit- ing process depends only on the integrated variance of the driving field, the diverging constants appearing in the definition of the reference frame also depend on higher order moments.

No abstract uploaded!

We consider a general class of $N\times N$ random matrices whose entries $h_{ij}$ are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous results [14] both in the bulk and at the edge. The error bounds are given in terms of the basic small parameter of the model, $\max_{i,j} \E \abs{h_{ij}}^2$. As a consequence, we prove the universality of the local $n$-point correlation functions in the bulk spectrum for a class of matrices whose entries do not have comparable variances, including random band matrices with band width $W\gg N^{1-\e_n}$ with some $\e_n>0$ and with a negligible mean-field component. In addition, we provide a coherent and pedagogical proof of the local semicircle law, streamlining and strengthening previous arguments from [17,19,6].

The goal of this paper is to prove rigorous results for the behavior of genealogies in a one-dimensional long range biased voter model introduced by Hallatschek and Nelson [Theor. Pop. Biol. 73 (2008) 158–170]. The first step, which is easily accomplished using results of Mueller and Tribe [Probab. Theory Related Fields 102 (1995) 519–545], is to show that when space and time are rescaled correctly, our biased voter model converges to a Wright–Fisher SPDE. A simple extension of a result of Durrett and Restrepo [Ann. Appl. Probab. 18 (2008) 334–358] then shows that the dual branching coalescing random walk converges to a branching Brownian motion in which particles coalesce after an exponentially distributed amount of intersection local time. Brunet et al. [Phys. Rev. E (3) 76 (2007) 041104, 20] have conjectured that genealogies in models of this type are described by the Bolthausen–Sznitman coalescent, see [Proc. Natl. Acad. Sci. USA 110 (2013) 437–442]. However, in the model we study there are no simultaneous coalescences. Our third and most significant result concerns “tracer dynamics” in which some of the initial particles in the biased voter model are labeled. We show that the joint distribution of the labeled and unlabeled particles converges to the solution of a system of stochastic partial differential equations. A new duality equation that generalizes the one Shiga [In Stochastic Processes in Physics and Engineering (Bielefeld, 1986) (1988) 345–355 Reidel] developed for the Wright–Fisher SPDE is the key to the proof of that result.