We use the known convergence of loop-erased random walk to radial SLE(2) to give a new proof that the scaling limit of loop-erased random walk excursion in the upper half-plane is chordal SLE(2). Our proof relies on a version of Wilson’s algorithm for weighted graphs which is used together with a Beurling-type estimate for random walk excursion. We also establish and use the convergence of the radial SLE path to the chordal SLE path as the bulk point tends to a boundary point. In the final section we sketch how to extend our results to more general simply connected domains.

We consider the problem of the random fluctuations in the solutions to elliptic PDEs with highly oscillatory random coefficients. In our setting, as the correlation length of the fluctuations tends to zero, the heterogeneous solution converges to a deterministic solution obtained by averaging. When the Green’s function to the unperturbed operator is sufficiently singular (i.e., not square integrable locally), the leading corrector to the averaged solution may be either deterministic or random, or both in a sense we shall explain. Our main application is the solution of an elliptic problem with random Robin boundary condition that may be used to model diffusion of signaling molecules through a layer of cells into a bulk of extracellular medium. The problem is then described by an elliptic pseudo-differential operator (a Dirichlet-to-Neumann operator) on the boundary of the domain with random potential. In the physical setting of a three dimensional extracellular medium on top of a two-dimensional surface of cells forming a layer of epithelium, we show that the approximate corrector to averaging consists of a deterministic correction plus a Gaussian field of amplitude proportional to the correlation length of the random medium. The result is obtained under some assumptions on the four-point correlation function in the medium. We provide examples of such random media based on Gaussian and Poisson statistics.

No abstract uploaded!

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 consider a general class of $N\times N$ random matrices whose entries $h_{ij}$ are independent up to a symmetry constraint, but not necessarily identically distributed. Our main result is a local semicircle law which improves previous results [14] both in the bulk and at the edge. The error bounds are given in terms of the basic small parameter of the model, $\max_{i,j} \E \abs{h_{ij}}^2$. As a consequence, we prove the universality of the local $n$-point correlation functions in the bulk spectrum for a class of matrices whose entries do not have comparable variances, including random band matrices with band width $W\gg N^{1-\e_n}$ with some $\e_n>0$ and with a negligible mean-field component. In addition, we provide a coherent and pedagogical proof of the local semicircle law, streamlining and strengthening previous arguments from [17,19,6].