Search arXivSearch

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$_κ$ (both with simple and non-simple loops, i.e., for the whole range $κ\in (8/3, 8)$) how to derive the connection probabilities in conformal rectangles for a conditioned version of CLE$_κ$ which can be interpreted as a CLE$_κ$ 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 π/ κ))$. 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$_κ$ where $κ$ is the value in $(8/3, 4]$ such that $-2 \cos (4 π/ κ)$ is equal to $N$ (resp. the value in $[4,8)$ such that $-2 \cos (4π/ κ)$ is equal to $\sqrt {q}$). Our arguments and computations build on the one hand on Dubédat's SLE commutation relations (as developed and used by Dubédat, Zhan or Bauer-Bernard-Kytölä) 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

Explore connections, maps & timelines

BibTeXRIS

Jason Miller, Wendelin Werner. 2018-05-28. 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

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR