Cluster volumes for the Gaussian free field on metric graphs

Alexander Drewitz; Alexis Pr\'evost; Pierre-Fran\c{c}ois Rodriguez

Cluster volumes for the Gaussian free field on metric graphs

T0 review · 0 major / 6 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read In d = 3, 4, 5, the critical cluster of the Gaussian free field has volume of order r^{(d+2)/2}, proving the conjectured exponents.

desk verdict Genuinely new matching lower bounds for critical GFF cluster volumes in d=3,4,5; solid proof, honestly conditioned on a recent one-arm estimate. read the letter →

arxiv 2412.06772 v1 pith:6ORGFASO submitted 2024-12-09 math.PR math-phmath.MP

Alexander Drewitz , Alexis Prévost , Pierre-François Rodriguez This is my paper · ORCID

classification math.PRmath-phmath.MP MSC 60K3560G1582B43

keywords Gaussianfreefieldmetricgraphspercolationcriticalexponentsclustervolumesrandominterlacementsone-armprobability

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper determines the volume of critical clusters in the percolation of level sets of the Gaussian free field on metric graphs, in the three genuinely intermediate dimensions 3, 4 and 5. It proves that the probability that the cluster of the origin contains at least n vertices is, up to constants, $n^{{-(d-2)/(d+2)}}$, and that the largest cluster inside a box of side length r has volume of order $r^{{(d+2)/2}}$ with high probability. These are the exponents conjectured for this model, and they are not the mean-field values that hold in dimensions 7 and above; before this paper, no volume exponent below d=6 was known rigorously. The same method applies to any transient graph with polynomial volume growth and polynomial Green-function decay once a normalized critical one-arm probability stays bounded.

What carries the argument

The load-bearing object is the normalized critical one-arm probability q(r) = $r^{{ν/2}}$ sup_{x∈G} P(x connects to ∂~B(x,r)), where ν is the exponent of the Green-function decay (ν=d-2 on Z^d). The proof's core construction, Proposition 4.1, selects the critical cluster with largest capacity inside a box, threads independent random-interlacement trajectories through it, and keeps every critical cluster touched by those trajectories; the isomorphism between the metric-graph Gaussian free field and random interlacements turns this decorated set into a genuine level-set cluster with both large volume and large capacity. A change-of-measure ('entropic repulsion') bound then converts the presence of such a cluster into the volume tails of Theorems 1.1 and 1.3. The whole mechanism runs only when q(r) stays bounded, which is exactly what the one-arm results provide on $Z^{3}$, $Z^{4}$ and $Z^{5}$.

What would settle it

On $Z^{4}$, simulate the normalized one-arm probability q(r) = r P(0 connects to the boundary of ~B(0,r)) for r up to $10^{4}$; if q(r) grows without bound, the standing assumption sup q<∞ fails and the hub construction collapses. Independently, on $Z^{3}$ estimate the slope of log P(|$K^{0}$|≥n) against log n for large n; a slope apart from -1/5 would contradict Theorem 1.1 directly.

Watch

Extended reading notes

Core claim

The central result, Theorem 1.1, is a two-sided estimate on Z^d for d∈{3,4,5}: there are constants c,C such that c $n^{{-(d-2)/(d+2)}}$ ≤ P(|$K^{0}$| ≥ n) ≤ C $n^{{-(d-2)/(d+2)}}$ for every n≥1, and for r,t with $r^{{(d+2)/2}}$ ≥ C t, with probability at least 1-C $t^{{-c}}$ the largest critical cluster in a box of radius r has cardinality between (1/t)$r^{{(d+2)/2}}$ and t $r^{{(d+2)/2}}$. Hence the critical exponents δ = lim_n log n / log P(|$K^{0}$|≥n) and d_f = lim_r log $M^{0}$_r / log r exist and equal (d+2)/(d-2) and (d+2)/2, resolving the conjectured values below the upper critical dimension d=6. The paper also proves Theorem 1.3, a lower bound on the near-critical tail: for a∈[-1,1] and n≥1, P(n≤|K^a|<∞) ≥ c P(n≤|$K^{0}$|<∞) exp{-C|a|^{(d+2)/d} $n^{{(d-2)/d}}$}. In the general graph setting these statements take the form (2.13) and (2.19), with the exponents ν/(2α-ν) and α-ν/2 replacing the Z^d-specific ones.

Load-bearing premise

The proof assumes that the normalized critical one-arm probability q(r) = $r^{{ν/2}}$ sup_x P(x connects to the boundary of a box of radius r) stays bounded as r grows; should q(r) diverge, the hub cluster with large capacity would no longer be constructed, and the volume tails would not follow.

Editorial extensions

If this is right

On $\mathbb{Z}^3$, $\mathbb{Z}^4$ and $\mathbb{Z}^5$, the critical cluster-volume exponents are $\delta=(d+2)/(d-2)$ and $d_f=(d+2)/2$, matching the fractal-dimension conjecture for this model; this is the first rigorous determination below $d=6$.
The same bounds hold on every graph satisfying the volume-growth and Green-function assumptions $(V_\alpha),(G_\nu)$ with $\sup_r q(r)<\infty$; for instance, a $\mathbb{Z}^2$-times-Sierpinski-gasket graph has explicit but non-algebraic exponents $\delta\approx 3.9299$ and $d_f\approx 2.5339$.
In the near-critical regime the paper gives $P(n\le |K^a|<\infty) \ge c\, n^{-\nu/(2\alpha-\nu)} \exp\{-C|a|^{2-\nu/\alpha} n^{\nu/\alpha}\}$, and the resulting moment lower bound $\mathbb{E}[|K^a|^k; |K^a|<\infty] \ge c|a|^{1-k(2\alpha-\nu)/\nu}$ matches the conjectured gap exponent $\Delta=2d/(d-2)-1$ on $\mathbb{Z}^d$ once upper bounds are added.
The statement for the largest cluster fails for $d\ge 7$, where the volume of the largest cluster is of order $r^4$; the assumption $\sup_r q(r)<\infty$ is therefore not a technical convenience but a necessary hypothesis, as the paper notes in Remark 5.2,2).

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A natural test of the method is to push the same hub construction to $d=6$, where $q(r)$ grows only subpolynomially; the paper's Remark 5.2,3) indicates that the resulting tails should carry the same exponential cost with subpolynomial corrections, which would complete the exponent table at the upper critical dimension.
Because the argument only needs capacity-volume comparability and a bounded one-arm probability, it should transfer to any long-range-correlated percolation model in the same universality class, such as the discrete excursion sets of the Gaussian free field, for which the lower bound (1.11) already yields a sub-exponential tail.
One concrete observable to check numerically is the typical count of critical clusters with volume of order $r^{(d+2)/2}$ and diameter at least $sr$; Remark 5.2,5) predicts the expected number is of constant order, which a simulation on $\mathbb{Z}^3$ could verify directly.
If matching upper bounds for (1.12) are proved, the moment exponents of Corollary 1.4 would establish the conjectured value $\Delta=2d/(d-2)-1$, fixing the full set of gap exponents for this model.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Colleague,

The headline: this paper gets the critical cluster volume exponent δ=(d+2)/(d-2) and the largest-cluster dimension (d+2)/2 for the metric graph GFF on Z^d, d=3,4,5, matching Werner's conjecture. The new content is the lower bounds, and they're real. The upper bounds were already in the air from [7,8,16]; the matching lower bounds required a new mechanism, and Proposition 4.1 delivers it: build one big cluster by taking a high-capacity 'hub' cluster in a box and wiring it to the rest via interlacement trajectories. The proof also covers a general α,ν framework, which I thought was well executed.

I read the stress-test note and disagree with any reading that this is essentially conditional. Yes, the lower bounds rest on sup q<∞, imported from [8] for d=4,5 (and from [15,17] for d=3). Yes, for Z^4 the best previously available bound was q(r)≤(log r)^C, so if [8] is wrong the sharp power law (1.3) would not follow from this proof. But the paper states this assumption explicitly in (2.11), and Remark 5.2,2) explains why the condition is necessary. That's honest dependence, not circularity. I did not find an internal flaw. The constant bookkeeping in the r-scaling does hold: the sup q absorbed into the constants is why (5.12) gets the clean exponent. If you drop sup q<∞ you get extra q factors, but the theorem is stated under that assumption.

The one thing I'd flag as a mild weakness: Theorem 1.3 and Corollary 1.4 give lower bounds only; matching upper bounds at small a are open, and the paper says so. That's fine, but it's worth knowing before citing the off-critical exponent.

For a referee: give this to someone who knows the one-arm bounds in this area, and have them check [8]. The result is important and the proof is serious. I'd bring it to reading group and cite it if my work touched volume tails in GFF.

Referee Report

0 major / 6 minor

Summary. The paper studies the volume of critical and near-critical clusters of the metric graph Gaussian free field on graphs satisfying polynomial volume growth and Green's function decay. The main result is Theorem 1.1: for Z^d with d in {3,4,5}, the cluster size tail P(|K_0| >= n) is of order n^{-(d-2)/(d+2)}, and the largest cluster in a box of radius r has volume of order r^{(d+2)/2}. The paper also proves an off-critical lower bound with exponential correction, moment bounds, and a general version (Theorems 2.2, 2.5, Corollary 2.3) valid under the standing condition sup_r q(r) < infinity, where q is the normalized one-arm probability. The proofs use the isomorphism with random interlacements, a hub-and-spokes construction (Proposition 4.1), entropy bounds, and second-moment arguments. The Zd applications for d=4,5 rely on the external one-arm bound of [8].

Significance. If correct, these are the first rigorous volume exponents for level-set percolation of the Gaussian free field below the upper-critical dimension, settling the value of the fractal dimension conjectured by Werner and the tail exponent conjectured in [16]. The paper is well structured: the conditional theorems are proved in full, the assumptions (V_alpha), (G_nu), (p0) are explicit, and the general graph formulation is a genuine strength. The stress-test concern about the external one-arm bound does land, but it does not undermine the paper's own contribution: Theorem 2.2 is conditional on sup q < infinity, and the dependence on [8] for Z^4,Z^5 is openly displayed in (2.11) and Remark 2.1. The unconditional status of Theorem 1.1 in those dimensions is exactly the status of [8]; I view this as a caveat about provenance rather than an internal flaw.

minor comments (6)

[Remark 2.1, (2.11)] The sentence 'sup q < infinity, when alpha > 2nu and on Z^alpha, alpha = 3,4,5' is ambiguous: for Z^4 one has alpha = 2nu, so the reader cannot tell whether the alpha > 2nu clause or the Z^alpha clause is the one being invoked. Please rephrase to state explicitly that for Z^3 the bound comes from alpha > 2nu, while for Z^4 and Z^5 it is imported from [8].
[Remark 5.2, item 4)] The condition 'r >= C((n/|a|)^{1/alpha} wedge n^{2/(2alpha-nu)})' should use a maximum (vee), not a minimum (wedge); the cluster K^a_r must fit inside the ball of radius r, so r must be at least the larger of the two scales. As written with wedge the remark is false in the parameter range where the two scales differ.
[Proof of Corollary 2.3, page 26] The reference 'Theorem 2.2,(i)' is incorrect: Theorem 2.2 has a single assertion, not two items. It should read 'Theorem 2.2'.
[Section 2, after (2.3)] The phrase 'and call denote by ~B(x,r)' contains a typo; it should read 'and denote by ~B(x,r)'.
[Lemma 3.1 statement] The statement repeats 'x in G' and reads awkwardly: it first says 'For all x in G and for all K as in (3.1)...' and then later 'for all s,r>=1, a>=0 and x in G such that...'. Please reword to avoid the duplicated quantifier.
[Introduction, after Theorem 1.1] Consider adding a sentence near Theorem 1.1 noting that the verification of sup q < infinity for d=4,5 is due to [8], a recent preprint, so that the reader is immediately aware that the unconditional statement in those dimensions depends on an external input not proved in this paper.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the volume exponents are derived from independent one-arm probability and capacity inputs, not from the target quantities.

full rationale

The paper's central result, Theorem 1.1, is obtained from Theorem 2.2 and Theorem 2.5, which are proved under the standing assumption sup_r q(r)<∞, where q(r)=r^{ν/2} sup_x P(x connects to the boundary of ~B(x,r)) is the normalized critical one-arm probability. This input is a different observable from the cluster volume being predicted: it bounds the probability of a connection to a box boundary, not the distribution of |K0| or M_r^0. For Z^3 it is imported from the authors' own prior works [15,17], and for Z^4,Z^5 from [8] by Cai and Ding; these results do not assume the volume exponents established here. The volume tail exponent arises through a genuine derivation: Lemma 3.2 relates volume and capacity via cap(K)≤C|K| and cap(K)≥c|K|^{ν/α}, the capacity tail (3.8)/(3.10) supplies the probability that a cluster has large capacity, and the explicit choice r=(2n sup q^2/(c8 a))^{1/α} in (5.11) converts that capacity event into the polynomial factor n^{-ν/(2α-ν)} in (5.12). No parameter is fitted to the target tail, and no equation is shown to be equivalent to its input by construction. The upper bound (2.12) is likewise a direct substitution of q into the previously known capacity-based estimate from [16, Corollary 1.6]. The paper's Remark 5.2,2) honestly records that when sup q=∞ on Z^d, d≥7, the corresponding largest-cluster statement is false; this is a limitation of scope, not a circular step. Reliance on a recent external one-arm bound is a correctness risk but, under the stated rules, that is not circularity because the cited result is parameter-free, arises from a different observable, and does not include the target volume exponents among its assumptions.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The paper's claims rest on the standing graph assumptions (p0), (Valpha), (Gnu), on the external one-arm bound sup q<infinity, and on isomorphism and interlacement results from [12,14,16,32]. No parameter is fitted to data and no new entities are introduced. The exponents alpha and nu are graph parameters fixed by assumptions, not free parameters.

assumptions (6)

domain assumption Ellipticity assumption (p0): lambda_{x,y}/lambda_x >= c0 for all neighboring x,y.
Standing assumption on the underlying weighted graph; introduced in Section 2 and used throughout.
domain assumption Volume growth assumption (Valpha): c1 r^alpha <= lambda(B(x,r)) <= C1 r^alpha.
Polynomial volume growth assumed for all main theorems; Section 2.
domain assumption Green function decay assumption (Gnu): c2 d(x,y)^(-nu) <= g(x,y) <= C2 d(x,y)^(-nu).
Polynomial decay of the Green function implies transience and is assumed in Section 2.
domain assumption Bounded one-arm ratio: sup_r q(r)<infinity.
Imported for Z^3,Z^4,Z^5 from [8] and [15,17]; required for Proposition 4.1 and Theorems 2.2 and 2.5. It is an external theorem, not reproved here.
standard math Isomorphism with random interlacements and loop soups, equation (3.20).
Used in Proposition 3.4, Lemma 4.3, Theorem 2.5 and Lemma 5.1; proved in [32] and extended in [12].
standard math Local uniqueness and capacity estimates for random interlacements, equations (3.22)-(3.24).
Used in Proposition 3.4 and Remark 4.4; cited from [12], [16] and [36].

how reviews work

0 comments

Cite this review

Pith. "Pith review of Cluster volumes for the Gaussian free field on metric graphs." pith.science (2026). https://pith.science/paper/6ORGFASO

@misc{pith2026241206772,
  author       = {Pith},
  title        = {Pith review of: Cluster volumes for the Gaussian free field on metric graphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6ORGFASO}},
  note         = {Machine review of arXiv:2412.06772}
}

abstract

We study the volume of the critical clusters for the percolation of the level sets of the Gaussian free field on metric graphs. On $\mathbb{Z}^d$ below the upper-critical dimension $d=6$, we show that the largest such cluster in a box of side length $r$ has volume of order $r^{\frac{d+2}{2}}$, as conjectured by Werner in arXiv:2002.11487. This is in contrast to the mean-field regime $d>6$, where this volume is of order $r^4$. We further obtain precise asymptotic tails for the volume of the critical cluster of the origin, and a lower bound on the tail of the volume of the near-critical cluster of the origin below the upper-critical dimension. Our proof extends to any graph with polynomial volume growth and polynomial decay of the Green's function as long as the critical one-arm probability decays as the square root of the Green's function, which is satisfied in low enough dimension.

Figures

Figures reproduced from arXiv: 2412.06772 by the authors.

**Figure 1.** Constructing a large critical cluster (at height a = 0) comprising n points (with α = d = ν + 2 in the case of Z d ). The cluster is roughly obtained as the union of all the macroscopic sign clusters (light+dark red) inside a box of radius r hit by an independent interlacement (green) at level u = r −ν , for the above fine-tuned scale r = r(n). More precisely, and to ensure that this set is connected, one retains on… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

A switching identity for cable-graph loop soups and Gaussian free fields
math.PR 2025-02 accept novelty 8.0 of 10

Conditioning two cable-graph points to lie in the same Brownian loop-soup cluster adds an odd-numbered Poisson cloud of Brownian excursions between them, yielding an exact law for the conditional cluster and its GFF analogue.
Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs
math.PR 2024-12 accept novelty 8.0 of 10

For the critical GFF level set and loop soup on Z^d with d != 6, four IIC definitions coincide, and the conditioned cluster volume in B(M) is of order M^{min(d/2+1, 4)}.
Quasi-multiplicativity and regularity for metric graph Gaussian free fields
math.PR 2024-12 accept novelty 8.0 of 10

For all d≥3 except d=6, the probability that the critical metric-graph GFF level set connects two sets across an annulus equals, up to constants, N^{(6-d)∧0} times the product of the two one-sided connection probabilities.

Reference graph

Works this paper leans on

44 extracted references · 38 canonical work pages · cited by 3 Pith papers

[8]

Cai and J

Z. Cai and J. Ding. One-arm probabilities for metric grap h Gaussian free ﬁelds below and at the critical dimension. Preprint, arXiv:2406.02397, 2024

arXiv 2024
[16]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. Critical e xponents for a percolation model on transient graphs. Invent. Math. , 232(1):229–299, 2023

work page 2023
[1]

Aizenman

M. Aizenman. On the number of incipient spanning cluster s. Nuclear Phys. B , 485(3):551– 582, 1997

work page 1997
[2]

Aizenman, F

M. Aizenman, F. c. Delyon, and B. Souillard. Lower bounds o n the cluster size distribution. J. Statist. Phys. , 23(3):267–280, 1980

work page 1980
[3]

M. T. Barlow. Which values of the volume growth and escape t ime exponent are possible for a graph? Rev. Mat. Iberoamericana, 20(1):1–31, 2004

work page 2004
[4]

D. J. Barsky and M. Aizenman. Percolation critical expone nts under the triangle condition. Ann. Probab., 19(4):1520–1536, 1991

work page 1991
[5]

Bolthausen, J.-D

E. Bolthausen, J.-D. Deuschel, and O. Zeitouni. Entropic repulsion of the lattice free ﬁeld. Comm. Math. Phys. , 170(2):417–443, 1995

work page 1995
[6]

Bricmont, J

J. Bricmont, J. L. Lebowitz, and C. Maes. Percolation in st rongly correlated systems: the massless Gaussian ﬁeld. J. Statist. Phys. , 48(5-6):1249–1268, 1987

work page 1987

Show all 44 references

[7]

Cai and J

Z. Cai and J. Ding. One-arm exponent of critical level-se t for metric graph Gaussian free ﬁeld in high dimensions. Preprint, arXiv:2307.04434, 2023

2023 arXiv
[9]

Chalhoub, A

C. Chalhoub, A. Drewitz, A. Prévost, and P.-F. Rodriguez . Universality classes for perco- lation models with long-range correlations. Preprint, arXiv:2403.18787, 2024

2024 arXiv
[10]

Contreras, S

D. Contreras, S. Martineau, and V. Tassion. Supercriti cal percolation on graphs of poly- nomial growth. Duke Math. J. , 173(4):745–806, 2024

2024
[11]

Ding and M

J. Ding and M. Wirth. Percolation for level-sets of Gaus sian free ﬁelds on metric graphs. Ann. Probab., 48(3):1411–1435, 05 2020. 33

2020
[12]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. Geometry o f Gaussian free ﬁeld sign clusters and random interlacements. Preprint, arXiv:1811.05970, 2018

2018
[13]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. The sign cl usters of the massless Gaussian free ﬁeld percolate on Zd, d /greaterorequalslant3 (and more). Comm. Math. Phys. , 362(2):513–546, 2018

2018
[14]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. Cluster ca pacity functionals and isomorphism theorems for Gaussian free ﬁelds. Probab. Theory Related Fields , 183(1-2):255–313, 2022

2022
[15]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. Arm expone nt for the Gaussian free ﬁeld on metric graphs in intermediate dimensions. Preprint, arXiv:2312.10030, 2023

2023
[17]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. Critical o ne-arm probability for the metric gaussian free ﬁeld in low dimensions. Preprint, arXiv:2405.17417, 2024

2024 arXiv
[18]

Drewitz and P.-F

A. Drewitz and P.-F. Rodriguez. High-dimensional asym ptotics for percolation of Gaussian free ﬁeld level sets. Electron. J. Probab. , 20:no. 47, 39, 2015

2015
[19]

Duminil-Copin and R

H. Duminil-Copin and R. Panis. An alternative approach for the mean-ﬁeld behaviour of spread-out bernoulli percolation in dimensions d > 6. Preprint, arXiv:2410.03647, 2024

2024 arXiv
[20]

Fitzner and R

R. Fitzner and R. van der Hofstad. Mean-ﬁeld behavior fo r nearest-neighbor percolation in d > 10. Electronic Journal of Probability , 22(none):1 – 65, 2017

2017
[21]

P. J. Fitzsimmons and J. S. Rosen. Markovian loop soups: permanental processes and isomorphism theorems. Electron. J. Probab., 19:no. 60, 30, 2014

2014
[22]

Ganguly and K

S. Ganguly and K. Nam. The ant on loops: Alexander-orbac h conjecture for the critical level set of the Gaussian free ﬁeld. Preprint, arXiv:2403.02318, 2024

2024 arXiv
[23]

Goswami, P.-F

S. Goswami, P.-F. Rodriguez, and F. Severo. On the radiu s of Gaussian free ﬁeld excursion clusters. Ann. Probab., 50(5):1675–1724, 2022

2022
[24]

Hara and G

T. Hara and G. Slade. Mean-ﬁeld critical behaviour for p ercolation in high dimensions. Comm. Math. Phys. , 128(2):333–391, 1990

1990
[25]

Heydenreich and R

M. Heydenreich and R. van der Hofstad. Progress in high-dimensional percolation and ran- dom graphs. CRM Short Courses. Springer, Cham; Centre de Recherches Ma thématiques, Montreal, QC, 2017

2017
[26]

O. D. Jones. Transition probabilities for the simple ra ndom walk on the Sierpiński graph. Stochastic Process. Appl. , 61(1):45–69, 1996

1996
[27]

H. Kesten. Analyticity properties and power law estima tes of functions in percolation theory. J. Statist. Phys. , 25(4):717–756, 1981

1981
[28]

H. Kesten. Scaling relations for 2d-percolation. Comm. Math. Phys. , 109(1):109–156, 1987

1987
[29]

Kesten and Y

H. Kesten and Y. Zhang. The probability of a large ﬁnite c luster in supercritical Bernoulli percolation. Ann. Probab., 18(2):537–555, 1990

1990
[30]

Kozma and A

G. Kozma and A. Nachmias. Arm exponents in high dimensio nal percolation. J. Amer. Math. Soc. , 24(2):375–409, 2011. 34

2011
[31]

G. F. Lawler, O. Schramm, and W. Werner. One-arm exponen t for critical 2D percolation. Electron. J. Probab. , 7:no. 2, 13, 2002

2002
[32]

T. Lupu. From loop clusters and random interlacements t o the free ﬁeld. Ann. Probab., 44(3):2117–2146, 2016

2016
[33]

B. G. Nguyen. Gap exponents for percolation processes wi th triangle condition. J. Statist. Phys., 49(1-2):235–243, 1987

1987
[34]

Panagiotis and F

C. Panagiotis and F. Severo. Analyticity of Gaussian fr ee ﬁeld percolation observables. Commun. Math. Phys. , 396(1):187–223, 2022

2022
[35]

A. Prévost. First passage percolation, local uniquene ss for interlacements and capacity of random walk. Preprint, arXiv:2309.03880, 2023

2023
[36]

Ráth and A

B. Ráth and A. Sapozhnikov. On the transience of random in terlacements. Electron. Commun. Probab., 16:379–391, 2011

2011
[37]

Rodriguez and A.-S

P.-F. Rodriguez and A.-S. Sznitman. Phase transition a nd level-set percolation for the Gaussian free ﬁeld. Comm. Math. Phys. , 320(2):571–601, 2013

2013
[38]

S. Smirnov. Critical percolation in the plane: conform al invariance, Cardy’s formula, scaling limits. C. R. Acad. Sci. Paris Sér. I Math. , 333(3):239–244, 2001

2001
[39]

Smirnov and W

S. Smirnov and W. Werner. Critical exponents for two-di mensional percolation. Math. Res. Lett., 8(5-6):729–744, 2001

2001
[40]

Stauﬀer and A

D. Stauﬀer and A. Aharony. Introduction To Percolation Theory: Second Edition . CRC Press, 2018

2018
[41]

Sznitman

A.-S. Sznitman. Vacant set of random interlacements an d percolation. Ann. Math. (2) , 171(3):2039–2087, 2010

2010
[42]

Sznitman

A.-S. Sznitman. An isomorphism theorem for random inte rlacements. Electron. Commun. Probab., 17:no. 9, 9, 2012

2012
[43]

Sznitman

A.-S. Sznitman. Coupling and an application to level-s et percolation of the Gaussian free ﬁeld. Electron. J. Probab., 21:Paper No. 35, 26, 2016

2016
[44]

W. Werner. On clusters of Brownian loops in d dimensions. In In and out of equi- librium 3. Celebrating Vladas Sidoravicius , volume 77 of Progr. Probab., pages 797–817. Birkhäuser/Springer, Cham, 2021. 35

2021

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.

[1] [8]

Cai and J

Z. Cai and J. Ding. One-arm probabilities for metric grap h Gaussian free ﬁelds below and at the critical dimension. Preprint, arXiv:2406.02397, 2024

arXiv 2024

[2] [16]

Drewitz, A

A. Drewitz, A. Prévost, and P.-F. Rodriguez. Critical e xponents for a percolation model on transient graphs. Invent. Math. , 232(1):229–299, 2023

work page 2023

[3] [1]

Aizenman

M. Aizenman. On the number of incipient spanning cluster s. Nuclear Phys. B , 485(3):551– 582, 1997

work page 1997

[4] [2]

Aizenman, F

M. Aizenman, F. c. Delyon, and B. Souillard. Lower bounds o n the cluster size distribution. J. Statist. Phys. , 23(3):267–280, 1980

work page 1980

[5] [3]

M. T. Barlow. Which values of the volume growth and escape t ime exponent are possible for a graph? Rev. Mat. Iberoamericana, 20(1):1–31, 2004

work page 2004

[6] [4]

D. J. Barsky and M. Aizenman. Percolation critical expone nts under the triangle condition. Ann. Probab., 19(4):1520–1536, 1991

work page 1991

[7] [5]

Bolthausen, J.-D

E. Bolthausen, J.-D. Deuschel, and O. Zeitouni. Entropic repulsion of the lattice free ﬁeld. Comm. Math. Phys. , 170(2):417–443, 1995

work page 1995

[8] [6]

Bricmont, J

J. Bricmont, J. L. Lebowitz, and C. Maes. Percolation in st rongly correlated systems: the massless Gaussian ﬁeld. J. Statist. Phys. , 48(5-6):1249–1268, 1987

work page 1987