Search arXivSearch

arXiv · 2007.14707

Planar random-cluster model: fractal properties of the critical phase

Abstract

This paper is studying the critical regime of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4)$. More precisely, we prove crossing estimates in quads which are uniform in their boundary conditions and depend only on their extremal lengths. They imply in particular that any fractal boundary is touched by macroscopic clusters, uniformly in its roughness or the configuration on said boundary. Additionally, they imply that any sub-sequential scaling limit of the collection of interfaces between primal and dual clusters is made of loops that are non-simple. We also obtain a number of properties of so-called arm-events: three universal critical exponents (two arms in the half-plane, three arms in the half-plane and five arms in the bulk), quasi-multiplicativity and well-separation properties (even when arms are not alternating between primal and dual), and the fact that the four-arm exponent is strictly smaller than 2. These results were previously known only for Bernoulli percolation ($q = 1$) and the FK-Ising model ($q = 2$). Finally, we prove new bounds on the one, two and four arms exponents for $q\in[1,2]$. These improve the previously known bounds, even for Bernoulli percolation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hugo Duminil-Copin, Ioan Manolescu, Vincent Tassion. 2021-01-21. Planar random-cluster model: fractal properties of the critical phase. https://doi.org/10.1007/s00440-021-01060-6

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