Metraipolis › archive › dc_f4b43ebfa81e

On the one-arm probability for the metric graph Gaussian free field in high dimensions — arXiv:2611.05357

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05357
License (as archived)
CC0-1.0
Archived
2026-11-04T12:47:22.574Z
SHA-256 of the archived text
380f7bb8144e8e78f0be16a0fc71081cbaa18a545d5f045671151836ffa16688
Stable URL of this page
https://metraipolis.com/documento/dc_f4b43ebfa81e

How to cite

On the one-arm probability for the metric graph Gaussian free field in high dimensions — arXiv:2611.05357 — arXiv (en), https://arxiv.org/abs/2611.05357 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4b43ebfa81e (Metraipolis archive dc_f4b43ebfa81e, sha256 380f7bb8144e8e78f0be16a0fc71081cbaa18a545d5f045671151836ffa16688)
BibTeX
@misc{dcf4b43ebfa81e,
  title = {On the one-arm probability for the metric graph Gaussian free field in high dimensions — arXiv:2611.05357},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05357},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4b43ebfa81e; sha256 380f7bb8144e8e78f0be16a0fc71081cbaa18a545d5f045671151836ffa16688},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05357. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider the sign clusters of the Gaussian free field on the cable system of a transient weighted graph with volume growth exponent $\alpha$ and Green function decay exponent $\nu$. We prove that the probability that the cluster of a vertex reaches distance $R$ is of order $R^{-\beta}$ when $2\alpha<3\nu$, where $\beta=\alpha-\nu$ is the walk dimension, and that the same holds up to a logarithmic factor in the upper bound when $2\alpha=3\nu$. On $\mathbb Z^d$ these conditions read $d>6$ and $d=6$. The upper bound combines a general entropic bound, which compares the law of the cluster under the critical loop soup and under a massive one, with a Simon-Lieb-type inequality for the massive field derived from its Markov property. The arguments are robust and require no transitivity. The lower bound follows from a competition between the capacity and the volume of the cluster. In both bounds, the key quantity is the expected exit time of the random walk from balls, which links the volume of the cluster to its radius.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.05357 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:32:02.024Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).