No abstract uploaded!

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.

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.

We introduce an interacting particle system in which two families of reflected diffusions interact in a singular manner near a deterministic interface I. This system can be used to model the transport of positive and negative charges in a solar cell or the population dynamics of two segregated species under competition. A related interacting random walk model with discrete state spaces has recently been introduced and studied in Chen and Fan (2014). In this paper, we establish the functional law of large numbers for this new system, thereby extending the hydrodynamic limit in Chen and Fan (2014) to reflected diffusions in domains with mixed-type boundary conditions, which include absorption (harvest of electric charges). We employ a new and direct approach that avoids going through the delicate BBGKY hierarchy.