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

No abstract uploaded!

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk eigenvalues are of order one. Under the assumption $p N \gg N^{2/3}$, we prove the universality of eigenvalue distributions both in the bulk and at the edge of the spectrum. More precisely, we prove (1) that the eigenvalue spacing of the Erd{\H o}s-R\'enyi graph in the bulk of the spectrum has the same distribution as that of the Gaussian orthogonal ensemble; and (2) that the second largest eigenvalue of the Erd{\H o}s-R\'enyi graph has the same distribution as the largest eigenvalue of the Gaussian orthogonal ensemble. As an application of our method, we prove the bulk universality of generalized Wigner matrices under the assumption that the matrix entries have at least $4 + \epsilon$ moments.

No abstract uploaded!

We study inhomogeneous random graphs in the subcritical case. Among other results, we derive an exact formula for the size of the largest connected component scaled by log$n$, with$n$being the size of the graph. This generalizes a result for the “rank-1 case”. We also investigate branching processes associated with these graphs. In particular, we discover that the same well-known equation for the survival probability, whose positive solution determines the asymptotics of the size of the largest component in the supercritical case, also plays a crucial role in the subcritical case. However, now it is the$negative$solutions that come into play. We disclose their relationship to the distribution of the progeny of the branching process.

Consider $N\times N$ Hermitian or symmetric random matrices $H$ where the distribution of the $(i,j)$ matrix element is given by a probability measure $\nu_{ij}$ with a subexponential decay. Let $\sigma_{ij}^2$ be the variance for the probability measure $\nu_{ij}$ with the normalization property that $\sum_{i} \sigma^2_{ij} = 1$ for all $j$. Under essentially the only condition that $c\le N \sigma_{ij}^2 \le c^{-1}$ for some constant $c>0$, we prove that, in the limit $N \to \infty$, the eigenvalue spacing statistics of $H$ in the bulk of the spectrum coincide with those of the Gaussian unitary or orthogonal ensemble (GUE or GOE). We also show that for band matrices with bandwidth $M$ the local semicircle law holds to the energy scale $M^{-1}$.

Suppose that $\eta$ is a Schramm-Loewner evolution ($\SLE_\kappa$) in a smoothly bounded simply connected domain $D \subset \C$ and that $\phi$ is a conformal map from $\D$ to a connected component of $D \setminus \eta([0,t])$ for some $t>0$. The multifractal spectrum of $\eta$ is the function $(-1,1) \to [0,\infty)$ which, for each $s \in (-1,1)$, gives the Hausdorff dimension of the set of points $x \in \partial \D$ such that $|\phi'( (1-\epsilon) x)| = \epsilon^{-s+o(1)}$ as $\epsilon \to 0$. We rigorously compute the a.s.\ multifractal spectrum of $\SLE$, confirming a prediction due to Duplantier. As corollaries, we confirm a conjecture made by Beliaev and Smirnov for the a.s.\ bulk integral means spectrum of $\SLE$, we obtain the optimal H\"older exponent for a conformal map which uniformizes the complement of an $\SLE$ curve, and we obtain a new derivation of the a.s.\ Hausdorff dimension of the $\SLE$ curve for $\kappa \leq 4$. Our results also hold for the $\SLE_\kappa(\ul\rho)$ processes with general vectors of weight $\ul\rho$.

We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides with the local statistics of the corresponding Gaussian ensemble provided the distribution of the individual matrix element is smooth and the eigenvalues ${x_j}_{j=1}^N$ are close to their classical location ${\gamma_j}_{j=1}^N$ determined by the limiting density of eigenvalues. Under the scaling where the typical distance between neighboring eigenvalues is of order 1/N, the necessary apriori estimate on the location of eigenvalues requires only to know that $\E |x_j - \gamma_j |^2 \le N^{-1-\e}$ on average. This information can be obtained by well established methods for various matrix ensembles. We demonstrate the method by proving local spectral universality for Wishart matrices.