Let $D={\mathbb H} \setminus \cup_{k=1}^N C_k$ be a standard slit domain where $\mathbb H$ is the upper half plane and $C_k$, $1\leq k\leq N$, are mutually disjoint horizontal line segments in $\HH$. Given a Jordan arc $\gamma\subset D$ starting at $\partial {\mathbb H},$ let $g_t$ be the unique conformal map from $D\setminus \gamma[0,t]$ onto a standard slit domain $D_t$ satisfying the hydrodynamic normalization. We prove that $g_t$ satisfies an ODE with the kernel on its righthand side being the complex Poisson kernel of the Brownian motion with darning (BMD) for $D_t$, generalizing the chordal Loewner equation for the simply connected domain $D={\mathbb H}.$ Such a generalization has been obtained by Y. Komatu in the case of circularly slit annuli and by R. O. Bauer and R. M. Friedrich in the present chordal case, but only in the sense of the left derivative in $t$. We establish the differentiability of $g_t$ in $t$ to make the equation a genuine ODE. To this end, we first derive the continuity of $g_t(z)$ in $t$ with a certain uniformity in $z$ from a probabilistic expression of $\Im g_t(z)$ in terms of the BMD for $D$, which is then combined with a Lipschitz continuity of the complex Poisson kernel under the perturbation of standard slit domains to get the desired differentiability.

We consider the ensemble of adjacency matrices of Erdős–Rényi random graphs, that is, 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. We prove that, as long as $pN\to\infty$ (with a speed at least logarithmic in $N$), the density of eigenvalues of the Erdős–Rényi ensemble is given by the Wigner semicircle law for spectral windows of length larger than $N^{-1}$ (up to logarithmic corrections). As a consequence, all eigenvectors are proved to be completely delocalized in the sense that the $\ell^{\infty}$-norms of the $\ell^{2}$-normalized eigenvectors are at most of order $N^{-1/2}$ with a very high probability. The estimates in this paper will be used in the companion paper [Spectral statistics of Erdős–Rényi graphs II: Eigenvalue spacing and the extreme eigenvalues (2011) Preprint] to prove the universality of eigenvalue distributions both in the bulk and at the spectral edges under the further restriction that $pN\gg N^{2/3}$.

Let $\widetilde{X}_{M\times N}$ be a rectangular data matrix with independent real-valued entries $[\widetilde{x}_{ij}]$ satisfying $\mathbb {E}\widetilde{x}_{ij}=0$ and $\mathbb {E}\widetilde{x}^2_{ij}=\frac{1}{M}$, $N,M\to\infty$. These entries have a subexponential decay at the tails. We will be working in the regime $N/M=d_N,\lim_{N\to\infty}d_N\neq0,1,\infty$. In this paper we prove the edge universality of correlation matrices ${X}^{\dagger}X$, where the rectangular matrix $X$ (called the standardized matrix) is obtained by normalizing each column of the data matrix $\widetilde{X}$ by its Euclidean norm. Our main result states that asymptotically the $k$-point ($k\geq1$) correlation functions of the extreme eigenvalues (at both edges of the spectrum) of the correlation matrix ${X}^{\dagger}X$ converge to those of the Gaussian correlation matrix, that is, Tracy-Widom law, and, thus, in particular, the largest and the smallest eigenvalues of ${X}^{\dagger}X$ after appropriate centering and rescaling converge to the Tracy-Widom distribution. The asymptotic distribution of extreme eigenvalues of the Gaussian correlation matrix has been worked out only recently. As a corollary of the main result in this paper, we also obtain that the extreme eigenvalues of Gaussian correlation matrices are asymptotically distributed according to the Tracy-Widom law. The proof is based on the comparison of Green functions, but the key obstacle to be surmounted is the strong dependence of the entries of the correlation matrix. We achieve this via a novel argument which involves comparing the moments of product of the entries of the standardized data matrix to those of the raw data matrix. Our proof strategy may be extended for proving the edge universality of other random matrix ensembles with dependent entries and hence is of independent interest.

We analyze the random fluctuations of several multiscale algorithms, such as the multiscale finite element method (MsFEM) and the finite element heterogeneous multiscale method (HMM), that have been developed to solve partial differential equations with highly heterogeneous coefficients. Such multiscale algorithms are often shown to correctly capture the homogenization limit when the highly oscillatory random medium is stationary and ergodic. This paper is concerned with the random fluctuations of the solution about the deterministic homogenization limit. We consider the simplified setting of the one-dimensional elliptic equation, where the theory of random fluctuations is well understood. We develop a fluctuation theory for the multiscale algorithms in the presence of random environments with short-range and long-range correlations. For a given mesh size h, we show that the fluctuations converge in distribution in the space of continuous paths to Gaussian processes as the correlation length ε→0. We next derive the limit of such Gaussian processes as h→0 and compare this limit with the distribution of the random fluctuations of the continuous model. When such limits agree, we conclude that the multiscale algorithm captures the random fluctuations accurately and passes the corrector test. This property serves as an interesting benchmark to assess the behavior of the multiscale algorithm in practical situations where the assumptions necessary for the theory of homogenization are not met. What we find is that the computationally more expensive methods MsFEM, and HMM with a choice of parameter δ=h, correctly capture the random fluctuations both for short-range and long-range oscillations in the medium. The less expensive method HMM with δ<h correctly captures the fluctuations for long-range oscillations and strongly amplifies their size in media with short-range oscillations. We present a modified scheme with an intermediate computational cost that captures the random fluctuations in all cases.

No abstract uploaded!