Searcharxiv⌕ Search

arXiv · 2610.03703

Fractal dimension of critical Gaussian free field sign clusters

Abstract

We study metric graph sign clusters of the Gaussian free field on a large class of transient weighted graphs $G$ that are sufficiently low-dimensional, i.e. below the mean-field regime, and prove a macroscopic equivalence property: several natural ways to define macroscopic clusters - involving any of diameter, volume, or capacity functionals - are in fact the same. As a corollary, macroscopic clusters are characterized in low dimensions as those containing large loops in the corresponding loop soup picture, in contrast with the typical behavior in high dimensions. We then apply these results to the small-mesh scaling limit of critical clusters on $\varepsilon\mathbb{Z}^d$, $d=3,4,5$, as $\varepsilon \downarrow 0$. We prove that every subsequential scaling limit consists of sets with positive Brownian capacity whose Hausdorff and Minkowski dimensions are both equal to $1+\tfrac d2$, as conjectured by Werner. We also derive two-point crossing estimates in the limit, and show that each limiting loop soup cluster is the closure of the union of the scaling limits of the macroscopic loops it contains. Remarkably, unlike with planar Bernoulli percolation for instance, the determination of the Hausdorff dimension does not emerge from direct calculations involving a limiting object (such as $\text{SLE}_6$), but rather from the distinctive features of the discrete model itself.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Drewitz, Alexis Prévost, Pierre-François Rodriguez. 2026-10-02. Fractal dimension of critical Gaussian free field sign clusters. https://arxiv.org/abs/2610.03703

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The scaling limit of fair Peano paths

We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in identifying the scaling limit as the mesh-size of the grid tends to zero. It is known \cite{lawler-schramm-werner2002} that if the trees are sampled uniformly, then the scaling limit exists and equals ${\rm SLE}_8$. We show that if we simply follow the same steps as in \cite{lawler-schramm-werner2002}, then fair Peano paths have a deterministic scaling limit.

math.PR↗

Multiple SLE$_κ$ from CLE$_κ$

We introduce multichordal CLE$_κ$ which is a random collection of non-crossing loops together with additional chords connecting a set of marked boundary points. The chords have a random link pattern, and their law conditionally on the link pattern is a (global) multichordal SLE$_κ$. We show that multichordal CLE$_κ$ arises as the conditional law of the remainder of a partially explored CLE$_κ$. The multichordal CLE$_κ$ are the conjectural scaling limits of FK and loop $O(n)$ models with some wiring patterns of the boundary arcs. We further explain how CLE$_κ$ configurations can be locally resampled, and show that the partially explored strands can be relinked in any possible way with positive probability. Our results also establish a useful local independence property of CLE$_κ$. Altogether, the results and estimates in this paper serve to provide a toolbox for studying CLE$_κ$ and global multiple SLE$_κ$.

math.PR↗

Total progeny for spectrally negative branching L{é}vy processes with absorption

We consider a spectrally negative branching L{é}vy process in which particles are killed upon crossing below zero. It is known that such a process becomes extinct almost surely if the drift toward -$\infty$ is sufficiently strong to counterbalance the reproduction rate. In this note, we study the tail asymptotics of the number of particles absorbed at the boundary during the lifetime of the process, in both the subcritical and critical regimes.

math.PR↗