Metraipolis › archive › dc_8e24f3e295bb

Weighted isoperimetry implies percolation — arXiv:2609.07768

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.07768
License (as archived)
CC0-1.0
Archived
2026-10-16T14:32:38.235Z
SHA-256 of the archived text
607e174837d35c6645d3e412e68175ddbd58fa757bbc2b368bed1cca40566824
Stable URL of this page
https://metraipolis.com/documento/dc_8e24f3e295bb

How to cite

Weighted isoperimetry implies percolation — arXiv:2609.07768 — arXiv (en), https://arxiv.org/abs/2609.07768 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8e24f3e295bb (Metraipolis archive dc_8e24f3e295bb, sha256 607e174837d35c6645d3e412e68175ddbd58fa757bbc2b368bed1cca40566824)
BibTeX
@misc{dc8e24f3e295bb,
  title = {Weighted isoperimetry implies percolation — arXiv:2609.07768},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.07768},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8e24f3e295bb; sha256 607e174837d35c6645d3e412e68175ddbd58fa757bbc2b368bed1cca40566824},
  year = {2026}
}

Archived text

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

Consider an infinite edge-weighted graph satisfying an isoperimetric inequality of the type $\|\partial A\|\geq C|A|^\alpha$ for some $\alpha,C>0$, where $\|\partial A\|$ denotes the weighted size of the edge boundary of $A$. We prove that, for $C$ large enough depending on $\alpha$, if each edge is open independently with probability given by its weight, then any vertex is connected to infinity with positive probability. The result also holds under weaker isoperimetric assumptions and on finite graphs. The proof brings a new perspective on the recent proof of the Benjamini--Schramm conjecture concerning the same problem with homogeneous weights. The crucial novelty in our proof is that, rather than simply counting cutsets, we introduce a new Peierls argument which takes into account internal and external connectivity costs in addition to the cost of the blocking surface. We provide two applications for the above result. First, we show that every non-summable long-range percolation on $\mathbb{Z}^d$, $d\geq 2$, admits a percolating truncation, solving a conjecture of Sidoravicius, Surgailis and Vares and its generalization by Friedli and de Lima. Secondly, we show that there exists a universal constant $C < \infty$ such that $p_{\mathrm{c}} \leq C/\Delta$ for every transitive graph of superlinear growth and vertex degree $\Delta$, thus proving a conjecture of Easo and Hutchcroft.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.07768 — 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-16T14:09:59.778Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).