REVIEW 2 cited by
An equivalence between gauge-twisted and topologically conditioned scalar Gaussian free fields
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 study on the metric graphs two types of scalar Gaussian free fields (GFF), the usual one and the one twisted by a $\{-1,1\}$-valued gauge field. We show that the latter can be obtained, up to an additional deterministic transformation, by conditioning the first on a topological event. This event is that all the sign clusters of the field should be trivial for the gauge field, that is to say should not contain loops with holonomy $-1$. We also express the probability of this topological event as a ratio of two determinants of Laplacians to the power $1/2$, the usual Laplacian and the gauge-twisted Laplacian. As an example, this gives on annular planar domains the probability that no sign cluster of the metric graph GFF surrounds the inner hole of the domain. Based on our result on the metric graph, and on previous works by Werner and Cai-Ding on the clusters of the metric graph GFF in high dimension, we formulate an intensity doubling conjecture. According to it, if the space dimension is high enough, the cycles in the sign clusters of the metric graph GFF converge in the scaling limit to a Brownian loop soup of intensity parameter $\alpha = 1 = 2\times \dfrac{1}{2}$, which is the double of the intensity parameter appearing in isomorphism theorems.
Forward citations
Cited by 2 Pith papers
-
On Loops in critical high-dimensional percolation
Critical percolation in high dimensions contains a tight number of macroscopic loop-clusters, each with essentially one large loop, with subsequential Hausdorff scaling limits.
-
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.
Discussion (0). Continue with ORCID to comment.