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.

No abstract uploaded!

In the first part of this article, we proved a local version of the circular law up to the finest scale $N^{-1/2+ \e}$ for non-Hermitian random matrices at any point $z \in \C$ with ||z|−1|>c for any c>0 independent of the size of the matrix. Under the main assumption that the first three moments of the matrix elements match those of a standard Gaussian random variable after proper rescaling, we extend this result to include the edge case $|z|-1=\oo(1)$. Without the vanishing third moment assumption, we prove that the circular law is valid near the spectral edge $|z|-1=\oo(1)$ up to scale $N^{-1/4+ \e}$.

In this paper, we prove a necessary and sufficient condition for Tracy-Widom law of Wigner matrices. Consider N×N symmetric Wigner matrices H with Hij=N−1/2xij, whose upper right entries xij (1≤i<j≤N) are i.i.d. random variables with distribution μ and diagonal entries xii (1≤i≤N) are i.i.d. random variables with distribution $\wt \mu$. The means of μ and $\wt \mu$ are zero, the variance of μ is 1, and the variance of $\wt \mu$ is finite. We prove that Tracy-Widom law holds if and only if $\lim_{s\to \infty}s^4\p(|x_{12}| \ge s)=0$. The same criterion holds for Hermitian Wigner matrices.