Metraipolis › archive › dc_a683b00db80a
(Non-)coincidence of critical parameters for Poisson Zoos and Loop Soup Percolation on $\mathbb{Z^d}$, $d > 4$, and $\mathbb{T}_d$,$ d \ge 3$ — arXiv:2608.11198
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.11198
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:26:48.718Z
- SHA-256 of the archived text
b7d150ed2a3dd441dfc0f00580a661442b631a871d76abb830dc69bf5e9a5293- Stable URL of this page
https://metraipolis.com/documento/dc_a683b00db80a
How to cite
(Non-)coincidence of critical parameters for Poisson Zoos and Loop Soup Percolation on $\mathbb{Z^d}$, $d > 4$, and $\mathbb{T}_d$,$ d \ge 3$ — arXiv:2608.11198 — arXiv (en), https://arxiv.org/abs/2608.11198 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a683b00db80a (Metraipolis archive dc_a683b00db80a, sha256 b7d150ed2a3dd441dfc0f00580a661442b631a871d76abb830dc69bf5e9a5293)
BibTeX
@misc{dca683b00db80a,
title = {(Non-)coincidence of critical parameters for Poisson Zoos and Loop Soup Percolation on $mathbbZ^d$, $d > 4$, and $mathbbT_d$,$ d ge 3$ — arXiv:2608.11198},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.11198},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a683b00db80a; sha256 b7d150ed2a3dd441dfc0f00580a661442b631a871d76abb830dc69bf5e9a5293},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11198. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this article we investigate the (non)-coincidence of critical parameters for various related percolation problems. More precisely, for the random walk loop soup we show that on $\mathbb Z^d$, $d\ge 5$, the critical parameters for the percolation problems differ on the discrete graph and the respective metric graph. Moreover, on trees we deduce an analogous statement as well as the coincidence of the critical parameters for percolation and susceptibility for a more general class of percolation problems, the so-called Poisson zoo. Along the way we develop the useful notion of sensitivity to Bernoulli enhancements of such percolation problems with long range correlations, which builds on previously developed enhancement ideas. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.PR). Categorie arXiv: Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2608.11198 — 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-10-19T06:20:00.082Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).