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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
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.