SearcharxivSearch

arXiv · 1201.1496

Imaginary Geometry I: Interacting SLEs

Abstract

Fix constants χ>0 and θ\in [0,2π), and let h be an instance of the Gaussian free field on a planar domain. We study flow lines of the vector field e^{i(h/χ+θ)} starting at a fixed boundary point of the domain. Considering all θ\in [0,2π), one obtains a family of curves that look locally like SLE_κ, with κ\in (0,4), where χ= 2/κ^{1/2} - κ^{1/2}/2, which we interpret as the rays of a random geometry with purely imaginary curvature. We extend the fundamental existence and uniqueness results about these paths to the case that the paths intersect the boundary. We also show that flow lines of different angles cross each other at most once but (in contrast to what happens when h is smooth) may bounce off of each other after crossing. Flow lines of the same angle started at different points merge into each other upon intersecting, forming a tree structure. We construct so-called counterflow lines (SLE_{16/κ}) within the same geometry using ordered "light cones" of points accessible by angle-restricted trajectories and develop a robust theory of flow and counterflow line interaction. The theory leads to new results about SLE. For example, we prove that SLE_κ(ρ) processes are almost surely continuous random curves, even when they intersect the boundary, and establish Duplantier duality for general SLE_{16/κ}(ρ) processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Jason Miller, Scott Sheffield. 2016-02-27. Imaginary Geometry I: Interacting SLEs. https://arxiv.org/abs/1201.1496

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR