We study the well-posedness of a unified system of coupled forward-backward stochastic differential equations (FB-SDEs) with Levy jumps and double completely-S skew reflections. Owing to the reflections, the solution to an embedded Skorohod problem may be not unique, i.e., bifurcations may occur at reflection boundaries, the well-known contraction mapping approach can not be extended directly to solve our problem. Thus, we develop a weak convergence method to prove the well-posedness of an adapted 6-tuple weak solution in the sense of distribution to the unified system. The proof heavily depends on newly established Malliavin calculus for vector-valued Levy processes together with a generalized linear growth and Lipschitz condition that guarantees the well-posedness of the unified system even under a random environment. Nevertheless, if a more strict boundary condition is imposed, i.e., the spectral radii in certain sense for the reflections are strictly less than the unity, a unique adapted 6-tuple strong solution in the sense of sample pathwise is concerned. In addition, as applications and economical studies of our unified system, we also develop new techniques including deriving a generalized mutual information formula for signal processing over possible non-Gaussian channels with multi-input multi-output (MIMO) antennas and dynamics driven by Levy processes.

We consider sample covariance matrices of the form $X^*X$, where $X$ is an $M times N$ matrix with independent random entries. We prove the isotropic local Marchenko-Pastur law, i.e. we prove that the resolvent $(X^* X - z)^{-1}$ converges to a multiple of the identity in the sense of quadratic forms. More precisely, we establish sharp high-probability bounds on the quantity $langle v, (X^* X - z)^{-1} w rangle - langle v,w rangle m(z)$, where $m$ is the Stieltjes transform of the Marchenko-Pastur law and $v, w in mathbb C^N$. We require the logarithms of the dimensions $M$ and $N$ to be comparable. Our result holds down to scales $Im z geq N^{-1+epsilon}$ and throughout the entire spectrum away from 0. We also prove analogous results for generalized Wigner matrices.

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

Consider $N\times N$ hermitian or symmetric random matrices $H$ with independent entries, where the distribution of the $(i,j)$ matrix element is given by the probability measure $\nu_{ij}$ with zero expectation and with variance $\sigma_{ij}^2$. We assume that the variances satisfy the normalization condition $\sum_{i} \sigma^2_{ij} = 1$ for all $j$ and that there is a positive constant $c$ such that $c\le N \sigma_{ij}^2 \le c^{-1}$. We further assume that the probability distributions $\nu_{ij}$ have a uniform subexponential decay. We prove that the Stieltjes transform of the empirical eigenvalue distribution of $H$ is given by the Wigner semicircle law uniformly up to the edges of the spectrum with an error of order $ (N \eta)^{-1}$ where $\eta$ is the imaginary part of the spectral parameter in the Stieltjes transform. There are three corollaries to this strong local semicircle law: (1) Rigidity of eigenvalues: If $\gamma_j =\gamma_{j,N}$ denotes the {\it classical location} of the $j$-th eigenvalue under the semicircle law ordered in increasing order, then the $j$-th eigenvalue $\lambda_j$ is close to $\gamma_j$ in the sense that for any $\xi>1$ there is a constant $L$ such that \[\mathbb P \Big (\exists \, j : \; |\lambda_j-\gamma_j| \ge (\log N)^L \Big [ \min \big (\, j, N-j+1 \, \big) \Big ]^{-1/3} N^{-2/3} \Big) \le C\exp{\big[-c(\log N)^{\xi} \big]} \] for $N$ large enough. (2) The proof of the {\it Dyson's conjecture} \cite{Dy} which states that the time scale of the Dyson Brownian motion to reach local equilibrium is of order $N^{-1}$. (3) The edge universality holds in the sense that the probability distributions of the largest (and the smallest) eigenvalues of two generalized Wigner ensembles are the same in the large $N$ limit provided that the second moments of the two ensembles are identical.

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.