Search arXivSearch

arXiv · 2512.05867

The self-dual point of Fortuin--Kasteleyn planar maps is critical

Abstract

We study the Fortuin--Kasteleyn model of planar maps with parameter $q\in (0,4)$ at and away from its self-dual point. This model is also bijectively equivalent to the fully packed (bicoloured) loop-$O(n)$ model on planar triangulations. These have been traditionally studied using either techniques from analytic combinatorics (based in particular on the gasket decomposition of Borot, Bouttier and Guitter) or probabilistic arguments (based on Sheffield's hamburger-cheeseburger bijection). In this paper we establish a dictionary relating quantities of interest in both approaches. This has several consequences. First, we derive an exact expression for the partition function of the fully packed (colour-symmetric) loop-$O(n)$ model on triangulations, as a function of the outer boundary length. This confirms predictions by Gaudin and Kostov. In particular, this model exhibits critical behaviour, in the sense that the partition function exhibits a power-law decay characteristic of the critical regime at this self-dual point. Secondly, we derive precise asymptotics for geometric features of the self-dual Fortuin--Kasteleyn model of planar maps when $0 < q <4$, such as the exact polynomial tail behaviour of the perimeters of clusters and loops. This sharpens previous results of arXiv:1502.00450 and arXiv:1502.00546. Finally, we prove that Fortuin--Kasteleyn maps undergo a \emph{sharp} phase transition at the self-dual point in the sense that, away from the self-dual point, cluster sizes decay exponentially. This mirrors the celebrated result by Beffara and Duminil-Copin for $q\geq 1$ on a fixed lattice and constitutes the first result establishing that the self-dual point of Fortuin--Kasteleyn maps is the critical point. A key step of our proof is to use the above dictionary and the probabilistic results to justify rigorously an ansatz commonly assumed in the analytic combinatorics literature.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathanaël Berestycki, William Da Silva. 2026-04-02. The self-dual point of Fortuin--Kasteleyn planar maps is critical. https://arxiv.org/abs/2512.05867

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