We consider the KPZ equation in one space dimension driven by a sta- tionary centred space–time random field, which is sufficiently integrable and mixing, but not necessarily Gaussian. We show that, in the weakly asymmetric regime, the solution to this equation considered at a suitable large scale and in a suitable reference frame converges to the Hopf–Cole solution to the KPZ equation driven by space–time Gaussian white noise. While the limit- ing process depends only on the integrated variance of the driving field, the diverging constants appearing in the definition of the reference frame also depend on higher order moments.

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.

This article focuses on the characterization of global multiple Schramm– Loewner evolutions (SLE). The chordal SLE describes the scaling limit of a single interface in various critical lattice models with Dobrushin boundary conditions, and similarly, global multiple SLEs describe scaling limits of collections of interfaces in critical lattice models with alternating boundary conditions. In this article, we give a minimal amount of characterizing properties for the global multiple SLEs: we prove that there exists a unique probability measure on collections of pairwise disjoint continuous simple curves with a certain conditional law property. As a consequence, we obtain the convergence of multiple interfaces in the critical Ising, FK-Ising and percolation models.

We determine the asymptotics of the independence number of the random d-regular graph for all d≥d0. It is highly concentrated, with constant-order fluctuations around nα∗−c∗logn for explicit constants α∗(d) and c∗(d). Our proof rigorously confirms the one-step replica symmetry breaking heuristics for this problem, and we believe the techniques will be more broadly applicable to the study of other combinatorial properties of random graphs.

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.