Metraipolis › archive › dc_eca0891e3b68
Logarithmic corrections for four-dimensional loop percolation — arXiv:2611.06691
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.06691
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:27:46.400Z
- SHA-256 of the archived text
0054b8a5d8f0eecc25008da601a4553b93065e133dfe1256f889da2263ab9e3c- Stable URL of this page
https://metraipolis.com/documento/dc_eca0891e3b68
How to cite
Logarithmic corrections for four-dimensional loop percolation — arXiv:2611.06691 — arXiv (en), https://arxiv.org/abs/2611.06691 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eca0891e3b68 (Metraipolis archive dc_eca0891e3b68, sha256 0054b8a5d8f0eecc25008da601a4553b93065e133dfe1256f889da2263ab9e3c)
BibTeX
@misc{dceca0891e3b68,
title = {Logarithmic corrections for four-dimensional loop percolation — arXiv:2611.06691},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.06691},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eca0891e3b68; sha256 0054b8a5d8f0eecc25008da601a4553b93065e133dfe1256f889da2263ab9e3c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06691. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the one-arm probability of the discrete random-walk loop soup on $\mathbb{Z}^4$ at small positive intensity. Using the small-loop crossing and macroscopic attachment estimates of Gao, we prove that the expected capacity of the origin cluster formed by loops contained in a box grows at most as the square of the logarithm of the box radius. Consequently, there are constants $\alpha_0,c,C,\beta>0$ such that, for $0<\alpha\le\alpha_0$, \[ c\alpha R^{-2}[\log(R+2)]^{\beta\alpha} \le \mathbb{P}_\alpha(0\leftrightarrow B_R^c) \le C\alpha R^{-2}[\log(R+2)]^2. \] The interval $(0,\alpha_0]$ is strictly subcritical. The upper bound rests on a simultaneous capacity estimate for neighborhoods of loop ranges, followed by an expansion over chains in which sufficiently small intermediate loops have been removed. A deterministic bound on the variation of the surviving scale sequences makes the expansion summable. The positive logarithmic-power lower bound is already known from work of Chang and Sapozhnikov; we give a proof using macroscopic attachments and a layer-cake argument, with constants uniform at small intensity. In particular, the one-arm exponent equals two, and the logarithm of its correction has order $\log\log R$, for every fixed intensity in this interval. We also derive polynomial tail exponent one for the cardinality and capacity of the full cluster, determine their positive moment thresholds, and give an application to random wires.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.06691 — 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-05T18:18:04.069Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).