SearcharxivSearch

arXiv · 1201.1497

Imaginary geometry II: reversibility of SLE_κ(ρ_1;ρ_2) for κ\in (0,4)

Abstract

Given a simply connected planar domain D, distinct points x,y \in \partial D, and κ>0, the Schramm-Loewner evolution SLE_κis a random continuous non-self-crossing path in the closure of D from x to y. The SLE_κ(ρ_1;ρ_2) processes, defined for ρ_1, ρ_2 > -2, are in some sense the most natural generalizations of SLE_κ. When κ\leq 4, we prove that the law of the time-reversal of an \SLE_κ(ρ_1;ρ_2) from x to y is, up to parameterization, an SLE_κ(ρ_2;ρ_1) from y to x. This assumes that the "force points" used to define SLE_κ(ρ_1;ρ_2) are immediately to the left and right of the SLE seed. A generalization to arbitrary (and arbitrarily many) force points applies whenever the path does not (or is conditioned not to) hit the boundary of D except at the endpoints. The time-reversal symmetry has a particularly natural interpretation when the paths are coupled with the Gaussian free field and viewed as rays of a random geometry. It allows us to couple two instances of the Gaussian free field (with different boundary conditions) so that their difference is almost surely constant on either side of the path. In a fairly general sense, adding appropriate constants to the two sides of a ray reverses its orientation.

Explore related subjects

Keep this discovery

BibTeXRIS

Jason Miller, Scott Sheffield. 2016-02-27. Imaginary geometry II: reversibility of SLE_κ(ρ_1;ρ_2) for κ\in (0,4). https://arxiv.org/abs/1201.1497

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