REVIEW 4 cited by
Critical one-arm probability for the metric Gaussian free field in low dimensions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. Under the sole assumption that its sign clusters do not percolate, we derive an extension of Lupu's formula for the two-point function at criticality. We then focus on the low-dimensional case $0< \nu < \frac{\alpha}{2}$, where $\alpha$ governs the polynomial volume growth of $G$ and $\nu$ the decay rate of the Green's function on $G$. In particular, this includes the benchmark case ${G}=\mathbb{Z}^3$, for which $\alpha=3$ and $\nu= \alpha-2=1$. We prove under these assumptions that the critical one-arm probability decays with distance $R$ like $R^{-\frac{\nu}{2}}$, up to multiplicative constants.
Forward citations
Cited by 4 Pith papers
-
A switching identity for cable-graph loop soups and Gaussian free fields
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.
-
Cluster volumes for the Gaussian free field on metric graphs
Critical clusters of the Gaussian free field on Z^3, Z^4 and Z^5 have tail exponent delta=(d+2)/(d-2) and largest-cluster dimension (d+2)/2, confirming Werner's conjectures.
-
Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs
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
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.
Discussion (0). Continue with ORCID to comment.