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.

No abstract uploaded!

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.

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 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.