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

In an infinite sequence of independent identically distributed continuous random variables we study the number of strings of two subsequent records interrupted by a given number of non-records. By embedding in a marked Poisson process we prove that these counts are independent and Poisson distributed. Also the distribution of the number of uninterrupted strings of records is considered.

No abstract uploaded!