OpenAlex ·

Fractal dimension of critical Gaussian free field sign clusters

Alexander Drewitz, Alexis Prévost and Pierre‐François Rodriguez

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.03703
Original
Read it at the publisher
Topics
Mathematical PhysicsNumerical Analysis

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.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Mathematical Physics

Get the few papers worth your time in Mathematical Physics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics