Connection probabilities for conformal loop ensembles (Q1671026)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Connection probabilities for conformal loop ensembles
scientific article

    Statements

    Connection probabilities for conformal loop ensembles (English)
    0 references
    0 references
    0 references
    6 September 2018
    0 references
    From the text of the paper: ``A conformal loop ensemble (\(\mathrm{CLE}_k\)) for \(k\in (8/3,8)\) is a particular random collection of loops in a simply connected planar domain such that the loops in a \(\mathrm{CLE}_k\) are Shramm-Loewner evolutions (\(\mathrm{SLE}_k\)) type loops. The goal of the paper is to explain how to derive the connection probabilities in domains with four marked boundary points for a conditioned version of \(\mathrm{CLE}_k\) which can be interpreted as a \(\mathrm{CLE}_k\) with wired/free/wired/free boundary conditions on four boundary arcs. In particular, we prove that the probability that two wired sides of the square hook up so that they create one single loop is equal to \(1/(1-2\cos (4\pi/k)\). We shall explain that for some explicit function \(Y_k(L)\), the probability that the two vertical sides of the rectangle are part of the same \(\mathrm{CLE}_k\) loop is of the form \(Y_k(L)+\theta _kY_k(1/L))\) for some unknown value \({\theta _k}\). The goal of the paper will be to determine the value \(\theta _k\) for the entire range \(k \in (8/3,8)\): Theorem 1. The constant \(\theta _k\) is equal to \( - 2\cos (4\pi /k)\).''
    0 references
    0 references
    0 references
    0 references
    0 references
    conformal loop ensembles
    0 references
    connection probabilities
    0 references
    Schramm-Loewner evolutions
    0 references
    \(\mathrm{FK}(q)\)-percolation model
    0 references
    Gaussian free field
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references