SearcharxivSearch

arXiv · 1702.02919

Connection probabilities for conformal loop ensembles

Abstract

The goal of the present paper is to explain, based on properties of the conformal loop ensembles CLE$_\kappa$ (both with simple and non-simple loops, i.e., for the whole range $\kappa \in (8/3, 8)$) how to derive the connection probabilities in conformal rectangles for a conditioned version of CLE$_\kappa$ which can be interpreted as a CLE$_{\kappa}$ with wired/free/wired/free boundary conditions on four boundary arcs (the wired parts being viewed as portions of to-be-completed loops). In particular, in the case of a conformal square, we prove that the probability that the two wired sides hook up so that they create one single loop is equal to $1/(1 - 2 \cos (4 \pi / \kappa ))$. Comparing this with the corresponding connection probabilities for discrete O(N) models for instance indicates that if a dilute O(N) model (respectively a critical FK(q)-percolation model on the square lattice) has a non-trivial conformally invariant scaling limit, then necessarily this scaling limit is CLE$_\kappa$ where $\kappa$ is the value in $(8/3, 4]$ such that $-2 \cos (4 \pi / \kappa )$ is equal to $N$ (resp. the value in $[4,8)$ such that $-2 \cos (4\pi / \kappa)$ is equal to $\sqrt {q}$). Our arguments and computations build on the one hand on Dub\'edat's SLE commutation relations (as developed and used by Dub\'edat, Zhan or Bauer-Bernard-Kyt\"ol\"a) and on the other hand, on the construction and properties of the conformal loop ensembles and their relation to Brownian loop-soups, restriction measures, and the Gaussian free field, as recently derived in works with Sheffield and with Qian.

Explore related subjects

Keep this discovery

BibTeXRIS

Jason Miller, Wendelin Werner. 2017-02-09. Connection probabilities for conformal loop ensembles. https://doi.org/10.1007/s00220-018-3207-8

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